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-rb-sentinel_false-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:03:35,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:03:35,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:03:35,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:03:35,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:03:35,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:03:35,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:03:35,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:03:35,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:03:35,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:03:35,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:03:35,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:03:35,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:03:35,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:03:35,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:03:35,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:03:35,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:03:35,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:03:35,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:03:35,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:03:35,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:03:35,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:03:35,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:03:35,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:03:35,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:03:35,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:03:35,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:03:35,392 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:03:35,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:03:35,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:03:35,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:03:35,393 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-04 01:03:35,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:03:35,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:03:35,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:03:35,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:03:35,404 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:03:35,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:03:35,404 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:03:35,404 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:03:35,404 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:03:35,404 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:03:35,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:03:35,405 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:03:35,405 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:03:35,405 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:03:35,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:03:35,405 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:03:35,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:03:35,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:03:35,406 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:03:35,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:03:35,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:03:35,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:03:35,406 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 01:03:35,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 01:03:35,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 01:03:35,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:03:35,443 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:03:35,445 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:03:35,446 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:03:35,446 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:03:35,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-02-04 01:03:35,563 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:03:35,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:03:35,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:03:35,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:03:35,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:03:35,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9deb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35, skipping insertion in model container [2018-02-04 01:03:35,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,587 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:03:35,616 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:03:35,707 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:03:35,723 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:03:35,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35 WrapperNode [2018-02-04 01:03:35,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:03:35,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:03:35,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:03:35,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:03:35,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (1/1) ... [2018-02-04 01:03:35,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:03:35,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:03:35,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:03:35,767 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:03:35,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (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-04 01:03:35,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:03:35,810 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:03:35,810 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:03:35,810 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 01:03:35,810 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 01:03:35,810 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:03:35,810 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:03:35,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:03:35,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:03:36,222 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:03:36,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:03:36 BoogieIcfgContainer [2018-02-04 01:03:36,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:03:36,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:03:36,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:03:36,225 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:03:36,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:03:35" (1/3) ... [2018-02-04 01:03:36,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c119b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:03:36, skipping insertion in model container [2018-02-04 01:03:36,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:03:35" (2/3) ... [2018-02-04 01:03:36,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c119b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:03:36, skipping insertion in model container [2018-02-04 01:03:36,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:03:36" (3/3) ... [2018-02-04 01:03:36,227 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-02-04 01:03:36,233 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:03:36,243 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-04 01:03:36,267 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:03:36,267 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:03:36,267 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 01:03:36,267 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 01:03:36,267 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:03:36,267 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:03:36,267 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:03:36,267 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:03:36,268 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:03:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-02-04 01:03:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:03:36,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:36,289 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:36,289 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash 726209746, now seen corresponding path program 1 times [2018-02-04 01:03:36,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:36,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:36,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:36,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:36,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:36,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:36,395 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-04 01:03:36,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:36,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:03:36,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:03:36,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:03:36,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:03:36,407 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-02-04 01:03:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:36,628 INFO L93 Difference]: Finished difference Result 181 states and 188 transitions. [2018-02-04 01:03:36,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:03:36,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:03:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:36,637 INFO L225 Difference]: With dead ends: 181 [2018-02-04 01:03:36,637 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 01:03:36,639 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-04 01:03:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 01:03:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2018-02-04 01:03:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 01:03:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-02-04 01:03:36,670 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 8 [2018-02-04 01:03:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:36,671 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-02-04 01:03:36,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:03:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-02-04 01:03:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:03:36,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:36,671 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:36,671 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash 726209747, now seen corresponding path program 1 times [2018-02-04 01:03:36,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:36,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:36,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:36,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:36,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:36,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:36,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:36,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:03:36,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:03:36,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:03:36,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:03:36,730 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 4 states. [2018-02-04 01:03:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:36,827 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2018-02-04 01:03:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:03:36,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:03:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:36,829 INFO L225 Difference]: With dead ends: 151 [2018-02-04 01:03:36,829 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 01:03:36,830 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-04 01:03:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 01:03:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-04 01:03:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 01:03:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2018-02-04 01:03:36,838 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 8 [2018-02-04 01:03:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:36,838 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2018-02-04 01:03:36,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:03:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2018-02-04 01:03:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:03:36,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:36,839 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:36,839 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 3311897, now seen corresponding path program 1 times [2018-02-04 01:03:36,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:36,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:36,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:36,840 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:36,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:36,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:36,882 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-04 01:03:36,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:36,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:03:36,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:03:36,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:03:36,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:03:36,883 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 4 states. [2018-02-04 01:03:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:36,982 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-02-04 01:03:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:03:36,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:03:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:36,983 INFO L225 Difference]: With dead ends: 162 [2018-02-04 01:03:36,984 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 01:03:36,984 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-04 01:03:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 01:03:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2018-02-04 01:03:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 01:03:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-02-04 01:03:36,988 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 13 [2018-02-04 01:03:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:36,989 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-02-04 01:03:36,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:03:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-02-04 01:03:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:03:36,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:36,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:36,989 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash 3311898, now seen corresponding path program 1 times [2018-02-04 01:03:36,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:36,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:36,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:36,991 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:36,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:37,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:37,052 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-04 01:03:37,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:37,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:03:37,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:03:37,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:03:37,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:03:37,053 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 4 states. [2018-02-04 01:03:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:37,147 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-02-04 01:03:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:03:37,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:03:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:37,148 INFO L225 Difference]: With dead ends: 159 [2018-02-04 01:03:37,149 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 01:03:37,149 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-04 01:03:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 01:03:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-04 01:03:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 01:03:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-02-04 01:03:37,157 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 13 [2018-02-04 01:03:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:37,157 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-02-04 01:03:37,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:03:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-02-04 01:03:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:03:37,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:37,158 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] [2018-02-04 01:03:37,158 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash -969711578, now seen corresponding path program 1 times [2018-02-04 01:03:37,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:37,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:37,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:37,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:37,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:37,231 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-04 01:03:37,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:37,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:03:37,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:03:37,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:03:37,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:03:37,233 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 4 states. [2018-02-04 01:03:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:37,348 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-04 01:03:37,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:03:37,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 01:03:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:37,349 INFO L225 Difference]: With dead ends: 154 [2018-02-04 01:03:37,349 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 01:03:37,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:03:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 01:03:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2018-02-04 01:03:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 01:03:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-02-04 01:03:37,354 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 21 [2018-02-04 01:03:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:37,354 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-02-04 01:03:37,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:03:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-02-04 01:03:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:03:37,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:37,355 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] [2018-02-04 01:03:37,355 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -969711577, now seen corresponding path program 1 times [2018-02-04 01:03:37,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:37,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:37,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,356 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:37,357 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:37,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:37,439 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-04 01:03:37,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:37,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:03:37,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:03:37,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:03:37,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:03:37,440 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 7 states. [2018-02-04 01:03:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:37,648 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-02-04 01:03:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:03:37,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 01:03:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:37,649 INFO L225 Difference]: With dead ends: 175 [2018-02-04 01:03:37,649 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 01:03:37,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:03:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 01:03:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2018-02-04 01:03:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 01:03:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-02-04 01:03:37,654 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 21 [2018-02-04 01:03:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:37,654 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-02-04 01:03:37,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:03:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-02-04 01:03:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:03:37,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:37,655 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] [2018-02-04 01:03:37,655 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:37,656 INFO L82 PathProgramCache]: Analyzing trace with hash 115077033, now seen corresponding path program 1 times [2018-02-04 01:03:37,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:37,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:37,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,657 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:37,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:37,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:37,710 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-04 01:03:37,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:37,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:03:37,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:03:37,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:03:37,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:03:37,711 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 5 states. [2018-02-04 01:03:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:37,831 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-02-04 01:03:37,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:03:37,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 01:03:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:37,832 INFO L225 Difference]: With dead ends: 197 [2018-02-04 01:03:37,832 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 01:03:37,832 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-04 01:03:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 01:03:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2018-02-04 01:03:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 01:03:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-02-04 01:03:37,836 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 23 [2018-02-04 01:03:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:37,836 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-02-04 01:03:37,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:03:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-02-04 01:03:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:03:37,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:37,837 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] [2018-02-04 01:03:37,838 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash 115077034, now seen corresponding path program 1 times [2018-02-04 01:03:37,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:37,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:37,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:37,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:37,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:37,891 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-04 01:03:37,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:37,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:03:37,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:03:37,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:03:37,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:03:37,892 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 5 states. [2018-02-04 01:03:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:38,040 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-02-04 01:03:38,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:03:38,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 01:03:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:38,041 INFO L225 Difference]: With dead ends: 219 [2018-02-04 01:03:38,041 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 01:03:38,041 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-04 01:03:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 01:03:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 148. [2018-02-04 01:03:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 01:03:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-02-04 01:03:38,045 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 23 [2018-02-04 01:03:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:38,045 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-02-04 01:03:38,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:03:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-02-04 01:03:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:03:38,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:38,045 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-04 01:03:38,045 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:38,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253035, now seen corresponding path program 1 times [2018-02-04 01:03:38,046 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:38,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:38,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:38,047 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:38,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:38,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:38,137 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-04 01:03:38,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:38,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:03:38,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:03:38,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:03:38,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:03:38,138 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 9 states. [2018-02-04 01:03:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:38,473 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2018-02-04 01:03:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:03:38,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 01:03:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:38,474 INFO L225 Difference]: With dead ends: 161 [2018-02-04 01:03:38,474 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 01:03:38,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:03:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 01:03:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-02-04 01:03:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 01:03:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-04 01:03:38,478 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 27 [2018-02-04 01:03:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:38,478 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-04 01:03:38,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:03:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-04 01:03:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:03:38,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:38,483 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-04 01:03:38,483 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253036, now seen corresponding path program 1 times [2018-02-04 01:03:38,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:38,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:38,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:38,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:38,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:38,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:38,633 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-04 01:03:38,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:38,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:03:38,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:03:38,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:03:38,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:03:38,635 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 10 states. [2018-02-04 01:03:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:39,049 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-02-04 01:03:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:03:39,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 01:03:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:39,050 INFO L225 Difference]: With dead ends: 177 [2018-02-04 01:03:39,050 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 01:03:39,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 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-04 01:03:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 01:03:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2018-02-04 01:03:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 01:03:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-02-04 01:03:39,052 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 27 [2018-02-04 01:03:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:39,053 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-02-04 01:03:39,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:03:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-02-04 01:03:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:03:39,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:39,053 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] [2018-02-04 01:03:39,053 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 78293977, now seen corresponding path program 1 times [2018-02-04 01:03:39,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:39,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:39,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,054 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:39,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:39,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:39,107 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-04 01:03:39,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:39,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:03:39,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:03:39,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:03:39,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:03:39,108 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 8 states. [2018-02-04 01:03:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:39,265 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2018-02-04 01:03:39,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:03:39,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 01:03:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:39,266 INFO L225 Difference]: With dead ends: 180 [2018-02-04 01:03:39,266 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 01:03:39,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:03:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 01:03:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2018-02-04 01:03:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 01:03:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-04 01:03:39,270 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 33 [2018-02-04 01:03:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:39,271 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-04 01:03:39,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:03:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-04 01:03:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 01:03:39,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:39,272 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-04 01:03:39,272 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -133974448, now seen corresponding path program 1 times [2018-02-04 01:03:39,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:39,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:39,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:39,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:39,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:39,331 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-04 01:03:39,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:39,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:03:39,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:03:39,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:03:39,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:03:39,332 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 5 states. [2018-02-04 01:03:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:39,527 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-02-04 01:03:39,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:03:39,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 01:03:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:39,528 INFO L225 Difference]: With dead ends: 226 [2018-02-04 01:03:39,528 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 01:03:39,529 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-04 01:03:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 01:03:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 151. [2018-02-04 01:03:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 01:03:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-04 01:03:39,531 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-02-04 01:03:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:39,531 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-04 01:03:39,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:03:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-04 01:03:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 01:03:39,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:39,531 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-04 01:03:39,531 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:39,532 INFO L82 PathProgramCache]: Analyzing trace with hash -133974447, now seen corresponding path program 1 times [2018-02-04 01:03:39,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:39,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:39,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:39,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:39,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:39,576 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-04 01:03:39,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:39,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:03:39,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:03:39,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:03:39,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:03:39,577 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 5 states. [2018-02-04 01:03:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:39,783 INFO L93 Difference]: Finished difference Result 248 states and 265 transitions. [2018-02-04 01:03:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:03:39,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 01:03:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:39,784 INFO L225 Difference]: With dead ends: 248 [2018-02-04 01:03:39,785 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 01:03:39,785 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-04 01:03:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 01:03:39,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 150. [2018-02-04 01:03:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 01:03:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-04 01:03:39,788 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-02-04 01:03:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:39,788 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-04 01:03:39,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:03:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-04 01:03:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 01:03:39,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:39,790 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] [2018-02-04 01:03:39,790 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1586747252, now seen corresponding path program 1 times [2018-02-04 01:03:39,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:39,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:39,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:39,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:39,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:39,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:39,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 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-04 01:03:39,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:39,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:39,976 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-04 01:03:39,979 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-04 01:03:39,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:39,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:39,988 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-04 01:03:39,990 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-04 01:03:39,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-04 01:03:40,018 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 26 treesize of output 21 [2018-02-04 01:03:40,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,025 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-04 01:03:40,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,037 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 26 treesize of output 21 [2018-02-04 01:03:40,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,041 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-04 01:03:40,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2018-02-04 01:03:40,069 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-04 01:03:40,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,075 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-04 01:03:40,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,088 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-04 01:03:40,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,092 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-04 01:03:40,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-02-04 01:03:40,124 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 24 treesize of output 18 [2018-02-04 01:03:40,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,127 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 18 treesize of output 10 [2018-02-04 01:03:40,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,134 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 24 treesize of output 18 [2018-02-04 01:03:40,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:03:40,136 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 18 treesize of output 10 [2018-02-04 01:03:40,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:40,140 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-04 01:03:40,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-02-04 01:03:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:40,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:03:40,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-02-04 01:03:40,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:03:40,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:03:40,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:03:40,166 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 8 states. [2018-02-04 01:03:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:40,468 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2018-02-04 01:03:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:03:40,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-02-04 01:03:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:40,469 INFO L225 Difference]: With dead ends: 215 [2018-02-04 01:03:40,469 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 01:03:40,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:03:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 01:03:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 169. [2018-02-04 01:03:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 01:03:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-02-04 01:03:40,473 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 36 [2018-02-04 01:03:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:40,473 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-02-04 01:03:40,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:03:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2018-02-04 01:03:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:03:40,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:40,474 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, 1, 1, 1, 1] [2018-02-04 01:03:40,475 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:40,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027346, now seen corresponding path program 1 times [2018-02-04 01:03:40,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:40,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:40,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:40,476 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:40,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:40,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:40,610 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-04 01:03:40,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:40,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 01:03:40,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:03:40,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:03:40,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:03:40,611 INFO L87 Difference]: Start difference. First operand 169 states and 180 transitions. Second operand 12 states. [2018-02-04 01:03:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:41,006 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-02-04 01:03:41,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:03:41,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-04 01:03:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:41,007 INFO L225 Difference]: With dead ends: 171 [2018-02-04 01:03:41,007 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 01:03:41,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:03:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 01:03:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-02-04 01:03:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 01:03:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-02-04 01:03:41,011 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 38 [2018-02-04 01:03:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:41,011 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-02-04 01:03:41,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:03:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-02-04 01:03:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:03:41,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:41,012 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, 1, 1, 1, 1] [2018-02-04 01:03:41,012 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027347, now seen corresponding path program 1 times [2018-02-04 01:03:41,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:41,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:41,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:41,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:41,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:41,172 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-04 01:03:41,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:41,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 01:03:41,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:03:41,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:03:41,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:03:41,173 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 13 states. [2018-02-04 01:03:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:41,573 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-02-04 01:03:41,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:03:41,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 01:03:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:41,573 INFO L225 Difference]: With dead ends: 166 [2018-02-04 01:03:41,573 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 01:03:41,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:03:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 01:03:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2018-02-04 01:03:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 01:03:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-02-04 01:03:41,575 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 38 [2018-02-04 01:03:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:41,576 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-02-04 01:03:41,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:03:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-02-04 01:03:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:03:41,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:41,576 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, 1, 1, 1, 1] [2018-02-04 01:03:41,576 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1775732296, now seen corresponding path program 1 times [2018-02-04 01:03:41,576 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:41,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:41,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:41,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:41,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:41,637 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-04 01:03:41,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:41,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:03:41,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:03:41,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:03:41,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:03:41,639 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 5 states. [2018-02-04 01:03:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:41,733 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-02-04 01:03:41,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:03:41,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 01:03:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:41,734 INFO L225 Difference]: With dead ends: 145 [2018-02-04 01:03:41,735 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 01:03:41,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:03:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 01:03:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-02-04 01:03:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 01:03:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-02-04 01:03:41,737 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 38 [2018-02-04 01:03:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:41,737 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-02-04 01:03:41,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:03:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-02-04 01:03:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:03:41,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:41,738 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, 1, 1, 1, 1, 1] [2018-02-04 01:03:41,738 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash 377492563, now seen corresponding path program 1 times [2018-02-04 01:03:41,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:41,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:41,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,740 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:41,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:41,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:03:41,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:03:41,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:03:41,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:03:41,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:03:41,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:03:41,783 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 8 states. [2018-02-04 01:03:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:41,901 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-02-04 01:03:41,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:03:41,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 01:03:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:41,901 INFO L225 Difference]: With dead ends: 153 [2018-02-04 01:03:41,901 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 01:03:41,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:03:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 01:03:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2018-02-04 01:03:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 01:03:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2018-02-04 01:03:41,904 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 39 [2018-02-04 01:03:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:41,904 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2018-02-04 01:03:41,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:03:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2018-02-04 01:03:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 01:03:41,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:41,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:41,905 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 595067423, now seen corresponding path program 1 times [2018-02-04 01:03:41,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:41,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:41,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:41,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:41,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:41,970 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-04 01:03:41,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:41,971 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-04 01:03:41,981 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:42,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:42,008 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 13 treesize of output 10 [2018-02-04 01:03:42,010 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 10 treesize of output 9 [2018-02-04 01:03:42,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 01:03:42,014 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 19 treesize of output 15 [2018-02-04 01:03:42,018 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 3 [2018-02-04 01:03:42,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,020 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-04 01:03:42,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 01:03:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:03:42,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:03:42,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-02-04 01:03:42,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:03:42,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:03:42,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:03:42,043 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 9 states. [2018-02-04 01:03:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:42,207 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2018-02-04 01:03:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:03:42,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 01:03:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:42,208 INFO L225 Difference]: With dead ends: 164 [2018-02-04 01:03:42,208 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 01:03:42,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:03:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 01:03:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2018-02-04 01:03:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 01:03:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-04 01:03:42,210 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 43 [2018-02-04 01:03:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:42,210 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-04 01:03:42,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:03:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-04 01:03:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 01:03:42,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:42,211 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:03:42,211 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:42,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1932461330, now seen corresponding path program 1 times [2018-02-04 01:03:42,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:42,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:42,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:42,213 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:42,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:42,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:03:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:42,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:03:42,303 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-04 01:03:42,311 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:03:42,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:03:42,352 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 19 treesize of output 16 [2018-02-04 01:03:42,353 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 16 treesize of output 1 [2018-02-04 01:03:42,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,363 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 19 treesize of output 16 [2018-02-04 01:03:42,364 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 16 treesize of output 1 [2018-02-04 01:03:42,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-02-04 01:03:42,432 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 15 treesize of output 11 [2018-02-04 01:03:42,434 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-04 01:03:42,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,445 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 15 treesize of output 11 [2018-02-04 01:03:42,447 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-04 01:03:42,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:03:42,451 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-04 01:03:42,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-02-04 01:03:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:03:42,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:03:42,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-02-04 01:03:42,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:03:42,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:03:42,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:03:42,503 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 16 states. [2018-02-04 01:03:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:03:42,813 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-02-04 01:03:42,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:03:42,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 01:03:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:03:42,814 INFO L225 Difference]: With dead ends: 182 [2018-02-04 01:03:42,814 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 01:03:42,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:03:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 01:03:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2018-02-04 01:03:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 01:03:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-04 01:03:42,816 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 46 [2018-02-04 01:03:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:03:42,816 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-04 01:03:42,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:03:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-04 01:03:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 01:03:42,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:03:42,817 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, 1, 1, 1, 1] [2018-02-04 01:03:42,817 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:03:42,817 INFO L82 PathProgramCache]: Analyzing trace with hash -223241516, now seen corresponding path program 1 times [2018-02-04 01:03:42,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:03:42,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:03:42,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:42,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:03:42,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:03:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:03:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:03:42,843 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 01:03:42,860 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 01:03:42,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:03:42 BoogieIcfgContainer [2018-02-04 01:03:42,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:03:42,880 INFO L168 Benchmark]: Toolchain (without parser) took 7316.58 ms. Allocated memory was 402.1 MB in the beginning and 774.4 MB in the end (delta: 372.2 MB). Free memory was 358.6 MB in the beginning and 588.5 MB in the end (delta: -229.9 MB). Peak memory consumption was 142.4 MB. Max. memory is 5.3 GB. [2018-02-04 01:03:42,881 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 402.1 MB. Free memory is still 365.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:03:42,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.96 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 346.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:03:42,881 INFO L168 Benchmark]: Boogie Preprocessor took 34.52 ms. Allocated memory is still 402.1 MB. Free memory was 346.6 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:03:42,881 INFO L168 Benchmark]: RCFGBuilder took 456.37 ms. Allocated memory is still 402.1 MB. Free memory was 344.0 MB in the beginning and 301.5 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 5.3 GB. [2018-02-04 01:03:42,881 INFO L168 Benchmark]: TraceAbstraction took 6656.30 ms. Allocated memory was 402.1 MB in the beginning and 774.4 MB in the end (delta: 372.2 MB). Free memory was 301.5 MB in the beginning and 588.5 MB in the end (delta: -287.0 MB). Peak memory consumption was 85.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:03:42,882 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 402.1 MB. Free memory is still 365.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.96 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 346.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.52 ms. Allocated memory is still 402.1 MB. Free memory was 346.6 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 456.37 ms. Allocated memory is still 402.1 MB. Free memory was 344.0 MB in the beginning and 301.5 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6656.30 ms. Allocated memory was 402.1 MB in the beginning and 774.4 MB in the end (delta: 372.2 MB). Free memory was 301.5 MB in the beginning and 588.5 MB in the end (delta: -287.0 MB). Peak memory consumption was 85.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={16:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L993] FCALL list->next = null VAL [list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L994] FCALL list->prev = null VAL [list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L995] FCALL list->colour = BLACK VAL [list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L997] struct TSLL* end = list; VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1030] COND FALSE !(0) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1031] EXPR, FCALL end->colour VAL [end={21:0}, end->colour=1, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1032] COND TRUE null != end VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1034] EXPR, FCALL end->colour VAL [end={21:0}, end->colour=1, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={21:0}, end->next={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1045] COND TRUE null != list VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1047] EXPR, FCALL list->colour VAL [end={16:0}, list={21:0}, list->colour=1, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={16:0}, list={21:0}, list->next={16:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1056] end = list->next [L1057] FCALL free(list) VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1058] list = end VAL [end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1045] COND FALSE !(null != list) VAL [end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L1062] return 0; VAL [\result=0, end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={21:0}, malloc(sizeof(struct TSLL))={16:0}, null={16:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 160 locations, 67 error locations. UNSAFE Result, 6.6s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1913 SDtfs, 4535 SDslu, 4273 SDs, 0 SdLazy, 5503 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 153 SyntacticMatches, 14 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=14, 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, 20 MinimizatonAttempts, 596 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 665 ConstructedInterpolants, 0 QuantifiedInterpolants, 127228 SizeOfPredicates, 27 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 8/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-03-42-887.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-03-42-887.csv Received shutdown request...