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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:34:05,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:34:05,901 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:34:05,916 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:34:05,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:34:05,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:34:05,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:34:05,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:34:05,922 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:34:05,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:34:05,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:34:05,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:34:05,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:34:05,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:34:05,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:34:05,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:34:05,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:34:05,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:34:05,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:34:05,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:34:05,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:34:05,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:34:05,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:34:05,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:34:05,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:34:05,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:34:05,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:34:05,940 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:34:05,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:34:05,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:34:05,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:34:05,941 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:34:05,951 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:34:05,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:34:05,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:34:05,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:34:05,953 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:34:05,953 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:34:05,953 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:34:05,953 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:34:05,953 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:34:05,953 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:34:05,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:34:05,954 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:34:05,954 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:34:05,954 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:34:05,954 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:34:05,954 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:34:05,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:34:05,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:34:05,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:34:05,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:34:05,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:34:05,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:34:05,955 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:34:05,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:34:05,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:34:05,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:34:05,994 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:34:05,997 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:34:05,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:34:05,999 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:34:06,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 19:34:06,145 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:34:06,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:34:06,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:34:06,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:34:06,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:34:06,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56610e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06, skipping insertion in model container [2018-02-02 19:34:06,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,166 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:34:06,196 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:34:06,292 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:34:06,311 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:34:06,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06 WrapperNode [2018-02-02 19:34:06,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:34:06,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:34:06,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:34:06,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:34:06,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (1/1) ... [2018-02-02 19:34:06,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:34:06,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:34:06,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:34:06,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:34:06,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (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 19:34:06,393 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:34:06,393 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:34:06,393 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:34:06,393 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:34:06,394 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:34:06,734 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:34:06,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:34:06 BoogieIcfgContainer [2018-02-02 19:34:06,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:34:06,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:34:06,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:34:06,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:34:06,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:34:06" (1/3) ... [2018-02-02 19:34:06,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c357a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:34:06, skipping insertion in model container [2018-02-02 19:34:06,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:34:06" (2/3) ... [2018-02-02 19:34:06,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c357a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:34:06, skipping insertion in model container [2018-02-02 19:34:06,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:34:06" (3/3) ... [2018-02-02 19:34:06,740 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 19:34:06,747 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:34:06,753 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-02-02 19:34:06,776 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:34:06,776 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:34:06,777 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:34:06,777 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:34:06,777 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:34:06,777 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:34:06,777 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:34:06,777 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:34:06,778 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:34:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-02-02 19:34:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 19:34:06,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:06,796 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:06,796 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-02-02 19:34:06,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:06,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:06,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:06,830 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:06,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:06,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:06,915 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 19:34:06,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:06,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:34:06,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:34:06,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:34:06,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:34:06,928 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-02-02 19:34:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:07,151 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-02 19:34:07,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:34:07,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 19:34:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:07,163 INFO L225 Difference]: With dead ends: 123 [2018-02-02 19:34:07,163 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 19:34:07,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:34:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 19:34:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-02-02 19:34:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 19:34:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 19:34:07,197 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-02-02 19:34:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:07,197 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 19:34:07,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:34:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 19:34:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 19:34:07,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:07,198 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:07,198 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:07,199 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-02-02 19:34:07,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:07,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:07,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,200 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:07,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:07,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:07,275 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 19:34:07,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:07,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:34:07,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:34:07,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:34:07,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:34:07,278 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-02-02 19:34:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:07,400 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 19:34:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:34:07,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 19:34:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:07,402 INFO L225 Difference]: With dead ends: 111 [2018-02-02 19:34:07,402 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 19:34:07,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:34:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 19:34:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-02 19:34:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 19:34:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-02 19:34:07,410 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-02-02 19:34:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:07,410 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-02 19:34:07,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:34:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-02 19:34:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:34:07,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:07,411 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:07,411 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-02-02 19:34:07,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:07,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:07,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,412 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:07,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:07,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:07,462 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 19:34:07,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:07,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:34:07,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:34:07,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:34:07,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:34:07,464 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-02-02 19:34:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:07,589 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-02-02 19:34:07,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:34:07,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 19:34:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:07,591 INFO L225 Difference]: With dead ends: 95 [2018-02-02 19:34:07,591 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 19:34:07,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:34:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 19:34:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-02 19:34:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 19:34:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 19:34:07,596 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-02-02 19:34:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:07,597 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 19:34:07,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:34:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 19:34:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:34:07,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:07,597 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:07,598 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-02-02 19:34:07,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:07,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:07,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,599 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:07,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:07,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:07,671 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 19:34:07,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:07,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:34:07,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:34:07,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:34:07,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:34:07,672 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-02-02 19:34:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:07,782 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-02-02 19:34:07,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:34:07,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 19:34:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:07,784 INFO L225 Difference]: With dead ends: 113 [2018-02-02 19:34:07,784 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:34:07,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:34:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:34:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-02-02 19:34:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 19:34:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-02-02 19:34:07,787 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-02-02 19:34:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:07,788 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-02-02 19:34:07,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:34:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-02-02 19:34:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 19:34:07,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:07,788 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:07,788 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-02-02 19:34:07,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:07,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:07,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,790 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:07,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:07,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:07,861 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 19:34:07,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:07,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:34:07,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:34:07,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:34:07,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:34:07,862 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-02-02 19:34:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:08,070 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-02-02 19:34:08,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:34:08,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 19:34:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:08,071 INFO L225 Difference]: With dead ends: 145 [2018-02-02 19:34:08,071 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:34:08,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:34:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:34:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-02-02 19:34:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 19:34:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-02-02 19:34:08,076 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-02-02 19:34:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:08,077 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-02-02 19:34:08,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:34:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-02-02 19:34:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 19:34:08,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:08,077 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:08,077 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-02-02 19:34:08,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:08,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:08,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:08,079 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:08,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:08,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:08,119 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 19:34:08,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:08,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:34:08,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:34:08,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:34:08,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:34:08,120 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-02-02 19:34:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:08,297 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-02-02 19:34:08,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:34:08,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 19:34:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:08,298 INFO L225 Difference]: With dead ends: 141 [2018-02-02 19:34:08,299 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 19:34:08,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:34:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 19:34:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-02-02 19:34:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 19:34:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-02 19:34:08,304 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-02-02 19:34:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:08,305 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-02 19:34:08,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:34:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-02 19:34:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:34:08,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:08,305 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:08,306 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-02-02 19:34:08,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:08,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:08,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:08,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:08,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:08,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:08,465 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 19:34:08,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:08,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:34:08,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:34:08,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:34:08,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:34:08,466 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2018-02-02 19:34:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:08,719 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-02 19:34:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:34:08,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 19:34:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:08,721 INFO L225 Difference]: With dead ends: 139 [2018-02-02 19:34:08,721 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 19:34:08,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:34:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 19:34:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-02-02 19:34:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 19:34:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-02 19:34:08,726 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-02-02 19:34:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:08,726 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-02 19:34:08,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:34:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-02 19:34:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:34:08,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:08,727 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:08,727 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-02-02 19:34:08,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:08,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:08,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:08,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:08,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:08,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:08,913 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 19:34:08,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:08,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:34:08,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:34:08,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:34:08,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:34:08,914 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-02-02 19:34:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:09,182 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-02-02 19:34:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:34:09,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 19:34:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:09,183 INFO L225 Difference]: With dead ends: 172 [2018-02-02 19:34:09,183 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 19:34:09,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:34:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 19:34:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-02-02 19:34:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 19:34:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-02 19:34:09,186 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-02-02 19:34:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:09,186 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-02 19:34:09,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:34:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-02 19:34:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:34:09,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:09,187 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:09,187 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-02-02 19:34:09,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:09,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:09,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:09,188 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:09,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:09,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:09,260 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 19:34:09,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:09,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:34:09,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:34:09,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:34:09,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:34:09,261 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-02-02 19:34:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:09,489 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-02-02 19:34:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:34:09,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 19:34:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:09,490 INFO L225 Difference]: With dead ends: 122 [2018-02-02 19:34:09,490 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 19:34:09,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:34:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 19:34:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-02-02 19:34:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 19:34:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-02-02 19:34:09,492 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-02-02 19:34:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:09,492 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-02-02 19:34:09,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:34:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-02-02 19:34:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:34:09,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:09,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:09,493 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-02-02 19:34:09,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:09,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:09,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:09,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:09,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:09,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:09,598 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 19:34:09,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:09,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:34:09,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:34:09,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:34:09,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:34:09,599 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-02-02 19:34:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:10,090 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2018-02-02 19:34:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:34:10,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 19:34:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:10,091 INFO L225 Difference]: With dead ends: 117 [2018-02-02 19:34:10,091 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 19:34:10,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:34:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 19:34:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-02-02 19:34:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 19:34:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-02-02 19:34:10,094 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-02-02 19:34:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:10,095 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-02-02 19:34:10,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:34:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-02-02 19:34:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:34:10,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:10,096 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:10,096 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-02-02 19:34:10,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:10,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:10,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:10,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:10,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:10,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:10,253 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 19:34:10,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:10,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:34:10,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:34:10,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:34:10,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:34:10,255 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-02-02 19:34:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:10,572 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-02-02 19:34:10,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:34:10,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-02 19:34:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:10,573 INFO L225 Difference]: With dead ends: 146 [2018-02-02 19:34:10,573 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 19:34:10,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:34:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 19:34:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-02-02 19:34:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 19:34:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-02-02 19:34:10,576 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-02-02 19:34:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:10,576 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-02-02 19:34:10,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:34:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-02-02 19:34:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:34:10,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:10,577 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:10,577 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-02-02 19:34:10,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:10,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:10,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:10,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:10,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:10,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:10,805 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 19:34:10,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:10,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:34:10,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:34:10,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:34:10,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:34:10,805 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-02-02 19:34:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:11,060 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-02-02 19:34:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:34:11,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 19:34:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:11,061 INFO L225 Difference]: With dead ends: 158 [2018-02-02 19:34:11,061 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 19:34:11,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:34:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 19:34:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-02-02 19:34:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 19:34:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-02-02 19:34:11,064 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-02-02 19:34:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:11,064 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-02-02 19:34:11,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:34:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-02-02 19:34:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:34:11,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:11,065 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:11,065 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-02-02 19:34:11,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:11,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:11,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:11,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:11,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:11,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:11,113 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 19:34:11,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:11,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:34:11,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:34:11,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:34:11,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:34:11,114 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-02-02 19:34:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:11,250 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2018-02-02 19:34:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:34:11,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 19:34:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:11,251 INFO L225 Difference]: With dead ends: 139 [2018-02-02 19:34:11,251 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 19:34:11,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:34:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 19:34:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-02-02 19:34:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 19:34:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-02 19:34:11,253 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-02-02 19:34:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:11,254 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-02 19:34:11,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:34:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-02 19:34:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:34:11,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:11,254 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:11,255 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-02-02 19:34:11,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:11,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:11,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:11,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:11,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:11,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:11,519 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 19:34:11,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:11,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:34:11,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:34:11,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:34:11,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:34:11,520 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-02-02 19:34:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:11,877 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-02-02 19:34:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:34:11,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-02 19:34:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:11,878 INFO L225 Difference]: With dead ends: 165 [2018-02-02 19:34:11,878 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 19:34:11,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:34:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 19:34:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-02-02 19:34:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 19:34:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-02-02 19:34:11,883 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-02-02 19:34:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:11,883 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-02-02 19:34:11,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:34:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-02-02 19:34:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:34:11,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:11,884 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:11,884 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-02-02 19:34:11,884 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:11,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:11,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:11,885 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:11,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:11,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:12,224 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 19:34:12,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:12,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:34:12,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:34:12,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:34:12,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:34:12,225 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 13 states. [2018-02-02 19:34:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:12,780 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-02-02 19:34:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:34:12,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-02-02 19:34:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:12,781 INFO L225 Difference]: With dead ends: 148 [2018-02-02 19:34:12,781 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:34:12,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:34:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:34:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-02-02 19:34:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 19:34:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-02-02 19:34:12,784 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-02-02 19:34:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:12,784 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-02-02 19:34:12,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:34:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-02-02 19:34:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:34:12,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:12,785 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:12,785 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-02-02 19:34:12,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:12,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:12,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:12,786 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:12,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:12,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:12,983 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 19:34:12,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:12,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:34:12,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:34:12,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:34:12,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:34:12,984 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-02-02 19:34:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:13,245 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2018-02-02 19:34:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:34:13,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 19:34:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:13,246 INFO L225 Difference]: With dead ends: 153 [2018-02-02 19:34:13,246 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 19:34:13,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:34:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 19:34:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-02-02 19:34:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 19:34:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-02-02 19:34:13,248 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-02-02 19:34:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:13,248 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-02-02 19:34:13,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:34:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-02-02 19:34:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:34:13,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:13,248 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:13,249 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-02-02 19:34:13,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:13,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:13,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:13,249 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:13,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:13,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:13,354 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 19:34:13,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:13,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:34:13,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:34:13,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:34:13,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:34:13,355 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-02-02 19:34:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:13,587 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-02-02 19:34:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:34:13,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 19:34:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:13,588 INFO L225 Difference]: With dead ends: 147 [2018-02-02 19:34:13,588 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 19:34:13,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:34:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 19:34:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-02-02 19:34:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 19:34:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-02-02 19:34:13,590 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-02-02 19:34:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:13,591 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-02-02 19:34:13,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:34:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-02-02 19:34:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:34:13,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:13,591 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:13,591 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-02-02 19:34:13,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:13,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:13,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:13,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:13,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:13,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:34:13,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:13,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 19:34:13,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:34:13,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:34:13,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:34:13,790 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-02-02 19:34:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:14,153 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-02-02 19:34:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:34:14,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-02 19:34:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:14,153 INFO L225 Difference]: With dead ends: 147 [2018-02-02 19:34:14,154 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 19:34:14,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:34:14,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 19:34:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-02 19:34:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 19:34:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-02 19:34:14,156 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-02-02 19:34:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:14,156 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-02 19:34:14,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:34:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-02 19:34:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:34:14,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:14,157 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:14,157 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-02-02 19:34:14,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:14,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:14,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:14,157 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:14,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:14,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:34:14,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:34:14,282 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:34:14,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:14,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:34:14,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-02 19:34:14,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-02 19:34:14,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:14,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:14,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:14,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-02 19:34:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:34:14,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:34:14,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2018-02-02 19:34:14,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:34:14,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:34:14,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:34:14,444 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 12 states. [2018-02-02 19:34:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:14,928 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-02-02 19:34:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:34:14,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-02-02 19:34:14,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:14,928 INFO L225 Difference]: With dead ends: 143 [2018-02-02 19:34:14,929 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 19:34:14,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:34:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 19:34:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2018-02-02 19:34:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 19:34:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2018-02-02 19:34:14,931 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 34 [2018-02-02 19:34:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:14,931 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2018-02-02 19:34:14,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:34:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2018-02-02 19:34:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:34:14,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:14,931 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:14,931 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590978, now seen corresponding path program 1 times [2018-02-02 19:34:14,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:14,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:14,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:14,932 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:14,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:14,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:34:15,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:34:15,128 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:34:15,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:15,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:34:15,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-02 19:34:15,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-02-02 19:34:15,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:15,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:15,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-02 19:34:15,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-02-02 19:34:15,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:15,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:15,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:15,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-02-02 19:34:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:34:15,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:34:15,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-02-02 19:34:15,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:34:15,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:34:15,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:34:15,230 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand 14 states. [2018-02-02 19:34:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:16,016 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2018-02-02 19:34:16,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:34:16,016 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 19:34:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:16,017 INFO L225 Difference]: With dead ends: 175 [2018-02-02 19:34:16,017 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 19:34:16,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:34:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 19:34:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 146. [2018-02-02 19:34:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 19:34:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2018-02-02 19:34:16,019 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 34 [2018-02-02 19:34:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:16,019 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2018-02-02 19:34:16,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:34:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2018-02-02 19:34:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:34:16,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:16,020 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:16,020 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:16,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1352500762, now seen corresponding path program 1 times [2018-02-02 19:34:16,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:16,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:16,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:16,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:16,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:16,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:16,058 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 19:34:16,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:34:16,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:34:16,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:34:16,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:34:16,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:34:16,059 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand 3 states. [2018-02-02 19:34:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:16,086 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2018-02-02 19:34:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:34:16,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-02-02 19:34:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:16,101 INFO L225 Difference]: With dead ends: 216 [2018-02-02 19:34:16,101 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 19:34:16,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:34:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 19:34:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 164. [2018-02-02 19:34:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 19:34:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2018-02-02 19:34:16,105 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 34 [2018-02-02 19:34:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:16,105 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2018-02-02 19:34:16,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:34:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2018-02-02 19:34:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:34:16,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:16,105 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:16,106 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146596, now seen corresponding path program 1 times [2018-02-02 19:34:16,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:16,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:16,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:16,106 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:16,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:16,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:16,223 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 19:34:16,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:34:16,224 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:34:16,231 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:16,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:34:16,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:34:16,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 19:34:16,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:34:16,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:34:16,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-02 19:34:16,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 19:34:16,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:16,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 19:34:16,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-02-02 19:34:16,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 19:34:16,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:16,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:16,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:16,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-02 19:34:16,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2018-02-02 19:34:16,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 19:34:16,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:16,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:16,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:16,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-02 19:34:16,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:30 [2018-02-02 19:34:16,547 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:34:16,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-02-02 19:34:16,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:30 [2018-02-02 19:34:16,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-02-02 19:34:16,681 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:34:16,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-02-02 19:34:16,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:34:16,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2018-02-02 19:34:16,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-02-02 19:34:16,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-02-02 19:34:16,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:16,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:5 [2018-02-02 19:34:16,783 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 19:34:16,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:34:16,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-02-02 19:34:16,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:34:16,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:34:16,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=435, Unknown=8, NotChecked=0, Total=506 [2018-02-02 19:34:16,822 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 23 states. [2018-02-02 19:34:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:17,858 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-02-02 19:34:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:34:17,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2018-02-02 19:34:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:17,859 INFO L225 Difference]: With dead ends: 186 [2018-02-02 19:34:17,859 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 19:34:17,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1067, Unknown=13, NotChecked=0, Total=1406 [2018-02-02 19:34:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 19:34:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 164. [2018-02-02 19:34:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 19:34:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2018-02-02 19:34:17,862 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 38 [2018-02-02 19:34:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:17,862 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2018-02-02 19:34:17,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:34:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2018-02-02 19:34:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:34:17,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:17,863 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:17,863 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146597, now seen corresponding path program 1 times [2018-02-02 19:34:17,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:17,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:17,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:17,864 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:17,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:17,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:18,052 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 19:34:18,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:34:18,052 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:34:18,057 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:18,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:34:18,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:34:18,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:34:18,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:34:18,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:34:18,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-02 19:34:18,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 19:34:18,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 19:34:18,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 19:34:18,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 19:34:18,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,157 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-02 19:34:18,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 19:34:18,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-02 19:34:18,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 19:34:18,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-02 19:34:18,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-02-02 19:34:18,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 19:34:18,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-02 19:34:18,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 19:34:18,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-02 19:34:18,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:33 [2018-02-02 19:34:18,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-02-02 19:34:18,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-02-02 19:34:18,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2018-02-02 19:34:18,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:18,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2018-02-02 19:34:18,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:18,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:13 [2018-02-02 19:34:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:34:18,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:34:18,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-02 19:34:18,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:34:18,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:34:18,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:34:18,591 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand 19 states. [2018-02-02 19:34:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:34:19,767 INFO L93 Difference]: Finished difference Result 176 states and 192 transitions. [2018-02-02 19:34:19,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:34:19,767 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-02-02 19:34:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:34:19,768 INFO L225 Difference]: With dead ends: 176 [2018-02-02 19:34:19,768 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 19:34:19,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=642, Unknown=2, NotChecked=0, Total=812 [2018-02-02 19:34:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 19:34:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 155. [2018-02-02 19:34:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 19:34:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-02-02 19:34:19,771 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 38 [2018-02-02 19:34:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:34:19,771 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-02-02 19:34:19,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:34:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-02-02 19:34:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:34:19,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:34:19,772 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:34:19,772 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:34:19,772 INFO L82 PathProgramCache]: Analyzing trace with hash 102012898, now seen corresponding path program 1 times [2018-02-02 19:34:19,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:34:19,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:34:19,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:19,773 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:19,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:34:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:19,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:34:19,954 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 19:34:19,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:34:19,955 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:34:19,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:34:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:34:19,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:34:20,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:20,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:20,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:34:20,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-02 19:34:20,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:34:20,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:34:20,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 19:34:20,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-02 19:34:20,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:34:20,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:34:20,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-02-02 19:34:20,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-02-02 19:34:20,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-02-02 19:34:20,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:20,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:34:20,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-02 19:34:22,198 WARN L143 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 26 [2018-02-02 19:34:22,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:22,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-02-02 19:34:22,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:22,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-02-02 19:34:22,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:34:22,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:34:22,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:34:22,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:76 [2018-02-02 19:34:38,320 WARN L146 SmtUtils]: Spent 12020ms on a formula simplification. DAG size of input: 28 DAG size of output 20 [2018-02-02 19:34:38,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-02-02 19:34:38,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:34:38,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-02-02 19:34:38,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:38,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:38,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:34:38,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-02-02 19:34:38,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-02-02 19:34:38,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:34:38,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:38,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 19:34:38,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:34:38,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:34:38,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:34:38,384 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-02-02 19:34:38,418 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 19:34:38,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:34:38,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2018-02-02 19:34:38,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:34:38,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:34:38,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=399, Unknown=2, NotChecked=0, Total=506 [2018-02-02 19:34:38,452 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 23 states. [2018-02-02 19:35:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:35:26,071 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2018-02-02 19:35:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:35:26,071 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-02-02 19:35:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:35:26,072 INFO L225 Difference]: With dead ends: 256 [2018-02-02 19:35:26,072 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 19:35:26,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=363, Invalid=1115, Unknown=4, NotChecked=0, Total=1482 [2018-02-02 19:35:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 19:35:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 188. [2018-02-02 19:35:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 19:35:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 209 transitions. [2018-02-02 19:35:26,074 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 209 transitions. Word has length 39 [2018-02-02 19:35:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:35:26,075 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-02-02 19:35:26,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:35:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 209 transitions. [2018-02-02 19:35:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:35:26,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:35:26,075 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:35:26,075 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:35:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash 102012899, now seen corresponding path program 1 times [2018-02-02 19:35:26,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:35:26,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:35:26,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:26,076 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:26,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:26,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:35:26,280 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 19:35:26,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:35:26,280 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:35:26,285 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:26,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:35:26,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:35:26,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:26,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:26,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:35:26,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-02 19:35:26,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:35:26,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:35:26,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:35:26,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:35:26,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-02 19:35:26,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-02 19:35:26,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:35:26,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-02-02 19:35:26,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:35:26,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:35:26,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-02-02 19:35:26,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-02-02 19:35:26,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-02 19:35:26,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-02-02 19:35:26,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-02-02 19:35:26,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:26,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:35:26,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:68 [2018-02-02 19:35:28,528 WARN L143 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 19:35:28,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-02-02 19:35:28,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:28,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 58 [2018-02-02 19:35:28,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:35:28,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:35:28,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-02-02 19:35:28,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:28,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:28,609 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:35:28,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-02-02 19:35:28,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:28,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:28,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 82 [2018-02-02 19:35:28,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:28,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 42 [2018-02-02 19:35:28,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:35:28,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:35:28,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:35:28,710 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:106, output treesize:123 [2018-02-02 19:35:32,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-02-02 19:35:32,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:32,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-02-02 19:35:32,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-02-02 19:35:32,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:32,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-02-02 19:35:32,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:35:32,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:55 [2018-02-02 19:35:32,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2018-02-02 19:35:32,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-02-02 19:35:32,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-02-02 19:35:32,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-02 19:35:32,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 19:35:32,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:35:32,863 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:32,867 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:69, output treesize:9 [2018-02-02 19:35:32,878 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 19:35:32,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:35:32,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2018-02-02 19:35:32,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:35:32,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:35:32,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=310, Unknown=2, NotChecked=0, Total=380 [2018-02-02 19:35:32,897 INFO L87 Difference]: Start difference. First operand 188 states and 209 transitions. Second operand 20 states. [2018-02-02 19:35:35,125 WARN L143 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-02 19:35:37,328 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 44 [2018-02-02 19:35:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:35:37,586 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2018-02-02 19:35:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:35:37,586 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-02-02 19:35:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:35:37,587 INFO L225 Difference]: With dead ends: 254 [2018-02-02 19:35:37,587 INFO L226 Difference]: Without dead ends: 254 [2018-02-02 19:35:37,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=192, Invalid=798, Unknown=2, NotChecked=0, Total=992 [2018-02-02 19:35:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-02 19:35:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2018-02-02 19:35:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-02 19:35:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2018-02-02 19:35:37,590 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 39 [2018-02-02 19:35:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:35:37,590 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2018-02-02 19:35:37,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:35:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2018-02-02 19:35:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:35:37,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:35:37,590 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:35:37,590 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:35:37,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1908893701, now seen corresponding path program 1 times [2018-02-02 19:35:37,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:35:37,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:35:37,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:37,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:37,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:37,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:35:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:35:37,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:35:37,815 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:35:37,820 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:37,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:35:37,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-02 19:35:37,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-02-02 19:35:37,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:37,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:37,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-02 19:35:37,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-02-02 19:35:37,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:37,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:37,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:37,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-02-02 19:35:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 19:35:37,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:35:37,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2018-02-02 19:35:37,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:35:37,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:35:37,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:35:37,910 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand 15 states. [2018-02-02 19:35:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:35:38,590 INFO L93 Difference]: Finished difference Result 227 states and 249 transitions. [2018-02-02 19:35:38,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:35:38,590 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-02-02 19:35:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:35:38,591 INFO L225 Difference]: With dead ends: 227 [2018-02-02 19:35:38,591 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 19:35:38,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:35:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 19:35:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 200. [2018-02-02 19:35:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 19:35:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 224 transitions. [2018-02-02 19:35:38,593 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 224 transitions. Word has length 43 [2018-02-02 19:35:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:35:38,593 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 224 transitions. [2018-02-02 19:35:38,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:35:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 224 transitions. [2018-02-02 19:35:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:35:38,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:35:38,594 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:35:38,594 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:35:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1908893700, now seen corresponding path program 1 times [2018-02-02 19:35:38,594 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:35:38,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:35:38,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:38,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:38,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:38,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:35:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 19:35:38,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:35:38,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:35:38,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:35:38,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:35:38,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:35:38,612 INFO L87 Difference]: Start difference. First operand 200 states and 224 transitions. Second operand 5 states. [2018-02-02 19:35:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:35:38,693 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2018-02-02 19:35:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:35:38,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-02 19:35:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:35:38,694 INFO L225 Difference]: With dead ends: 203 [2018-02-02 19:35:38,694 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 19:35:38,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:35:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 19:35:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-02-02 19:35:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 19:35:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2018-02-02 19:35:38,697 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 43 [2018-02-02 19:35:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:35:38,698 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2018-02-02 19:35:38,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:35:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2018-02-02 19:35:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:35:38,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:35:38,698 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:35:38,699 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:35:38,699 INFO L82 PathProgramCache]: Analyzing trace with hash 948679881, now seen corresponding path program 1 times [2018-02-02 19:35:38,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:35:38,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:35:38,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:38,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:38,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:38,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:35:38,890 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 19:35:38,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:35:38,891 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:35:38,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:38,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:35:38,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:38,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:38,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:35:38,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-02 19:35:38,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:35:38,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:35:38,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:35:38,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:35:38,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-02-02 19:35:38,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-02-02 19:35:38,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:35:38,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:38,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-02 19:35:39,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:35:39,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:35:39,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-02-02 19:35:39,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-02-02 19:35:39,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-02-02 19:35:39,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 74 [2018-02-02 19:35:39,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 35 [2018-02-02 19:35:39,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:35:39,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:98 [2018-02-02 19:35:39,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 102 [2018-02-02 19:35:39,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 64 [2018-02-02 19:35:39,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 88 [2018-02-02 19:35:39,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,235 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:35:39,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 74 [2018-02-02 19:35:39,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 90 [2018-02-02 19:35:39,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 74 [2018-02-02 19:35:39,260 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:35:39,298 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:143 [2018-02-02 19:35:39,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 162 [2018-02-02 19:35:39,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 140 [2018-02-02 19:35:39,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 84 [2018-02-02 19:35:39,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,421 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:35:39,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2018-02-02 19:35:39,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 88 [2018-02-02 19:35:39,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:35:39,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2018-02-02 19:35:39,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:35:39,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:35:39,493 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:220, output treesize:111 [2018-02-02 19:35:39,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-02-02 19:35:39,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-02-02 19:35:39,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:35:39,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:35:39,537 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2018-02-02 19:35:39,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-02-02 19:35:39,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 19:35:39,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-02 19:35:39,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:35:39,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-02-02 19:35:39,595 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 19:35:39,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:35:39,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-02-02 19:35:39,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:35:39,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:35:39,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:35:39,629 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand 24 states. [2018-02-02 19:35:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:35:40,227 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2018-02-02 19:35:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:35:40,227 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-02-02 19:35:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:35:40,228 INFO L225 Difference]: With dead ends: 253 [2018-02-02 19:35:40,228 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 19:35:40,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:35:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 19:35:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 199. [2018-02-02 19:35:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 19:35:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2018-02-02 19:35:40,230 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 43 [2018-02-02 19:35:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:35:40,230 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2018-02-02 19:35:40,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:35:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2018-02-02 19:35:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:35:40,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:35:40,230 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:35:40,230 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:35:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash 948679882, now seen corresponding path program 1 times [2018-02-02 19:35:40,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:35:40,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:35:40,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:40,231 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:35:40,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:35:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:35:40,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 19:35:40,433 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:35:40,438 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:35:40,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:35:40 BoogieIcfgContainer [2018-02-02 19:35:40,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:35:40,440 INFO L168 Benchmark]: Toolchain (without parser) took 94293.01 ms. Allocated memory was 399.0 MB in the beginning and 812.6 MB in the end (delta: 413.7 MB). Free memory was 355.9 MB in the beginning and 471.5 MB in the end (delta: -115.7 MB). Peak memory consumption was 298.0 MB. Max. memory is 5.3 GB. [2018-02-02 19:35:40,441 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:35:40,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.64 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 343.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-02 19:35:40,441 INFO L168 Benchmark]: Boogie Preprocessor took 32.53 ms. Allocated memory is still 399.0 MB. Free memory was 343.8 MB in the beginning and 342.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:35:40,441 INFO L168 Benchmark]: RCFGBuilder took 380.72 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 309.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:35:40,441 INFO L168 Benchmark]: TraceAbstraction took 93703.14 ms. Allocated memory was 399.0 MB in the beginning and 812.6 MB in the end (delta: 413.7 MB). Free memory was 309.9 MB in the beginning and 471.5 MB in the end (delta: -161.6 MB). Peak memory consumption was 252.0 MB. Max. memory is 5.3 GB. [2018-02-02 19:35:40,442 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.19 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.64 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 343.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.53 ms. Allocated memory is still 399.0 MB. Free memory was 343.8 MB in the beginning and 342.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 380.72 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 309.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 93703.14 ms. Allocated memory was 399.0 MB in the beginning and 812.6 MB in the end (delta: 413.7 MB). Free memory was 309.9 MB in the beginning and 471.5 MB in the end (delta: -161.6 MB). Peak memory consumption was 252.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 47 error locations. TIMEOUT Result, 93.6s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 61.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1752 SDtfs, 8526 SDslu, 7543 SDs, 0 SdLazy, 8662 SolverSat, 844 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 48.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 850 GetRequests, 299 SyntacticMatches, 58 SemanticMatches, 493 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 834 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1059 ConstructedInterpolants, 78 QuantifiedInterpolants, 574003 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 36 InterpolantComputations, 23 PerfectInterpolantSequences, 27/76 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-35-40-452.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-35-40-452.csv Completed graceful shutdown