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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-ccafca9-m
[2018-02-04 04:10:56,099 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-04 04:10:56,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-04 04:10:56,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-04 04:10:56,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-04 04:10:56,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-04 04:10:56,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-04 04:10:56,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-04 04:10:56,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-04 04:10:56,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-04 04:10:56,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-04 04:10:56,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-04 04:10:56,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-04 04:10:56,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-04 04:10:56,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-04 04:10:56,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-04 04:10:56,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-04 04:10:56,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-04 04:10:56,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-04 04:10:56,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-04 04:10:56,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-04 04:10:56,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-04 04:10:56,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-04 04:10:56,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-04 04:10:56,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-04 04:10:56,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-04 04:10:56,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-04 04:10:56,137 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-04 04:10:56,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-04 04:10:56,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-04 04:10:56,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-04 04:10:56,138 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf
[2018-02-04 04:10:56,148 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-04 04:10:56,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-04 04:10:56,149 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-04 04:10:56,149 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-04 04:10:56,150 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-04 04:10:56,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-04 04:10:56,150 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-04 04:10:56,150 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-04 04:10:56,150 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-04 04:10:56,151 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-04 04:10:56,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-04 04:10:56,151 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-04 04:10:56,151 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-04 04:10:56,151 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-04 04:10:56,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-04 04:10:56,151 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-04 04:10:56,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-04 04:10:56,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-04 04:10:56,152 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-04 04:10:56,152 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-04 04:10:56,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-04 04:10:56,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-04 04:10:56,153 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-04 04:10:56,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-04 04:10:56,153 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL
[2018-02-04 04:10:56,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-04 04:10:56,194 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-04 04:10:56,197 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-04 04:10:56,199 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-04 04:10:56,199 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-04 04:10:56,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i
[2018-02-04 04:10:56,355 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-04 04:10:56,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-04 04:10:56,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-04 04:10:56,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-04 04:10:56,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-04 04:10:56,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f0ca55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56, skipping insertion in model container
[2018-02-04 04:10:56,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,381 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 04:10:56,410 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 04:10:56,497 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 04:10:56,509 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 04:10:56,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56 WrapperNode
[2018-02-04 04:10:56,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-04 04:10:56,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-04 04:10:56,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-04 04:10:56,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-04 04:10:56,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (1/1) ...
[2018-02-04 04:10:56,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-04 04:10:56,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-04 04:10:56,540 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-04 04:10:56,540 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-04 04:10:56,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (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 04:10:56,576 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-04 04:10:56,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-04 04:10:56,577 INFO L136 BoogieDeclarations]: Found implementation of procedure exit
[2018-02-04 04:10:56,577 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-04 04:10:56,577 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-04 04:10:56,577 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-04 04:10:56,577 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-04 04:10:56,577 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-04 04:10:56,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-04 04:10:56,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-04 04:10:56,577 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure exit
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-04 04:10:56,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-04 04:10:56,760 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-04 04:10:56,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:10:56 BoogieIcfgContainer
[2018-02-04 04:10:56,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-04 04:10:56,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-04 04:10:56,761 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-04 04:10:56,763 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-04 04:10:56,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:10:56" (1/3) ...
[2018-02-04 04:10:56,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9967fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:10:56, skipping insertion in model container
[2018-02-04 04:10:56,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:56" (2/3) ...
[2018-02-04 04:10:56,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9967fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:10:56, skipping insertion in model container
[2018-02-04 04:10:56,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:10:56" (3/3) ...
[2018-02-04 04:10:56,765 INFO L107 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i
[2018-02-04 04:10:56,772 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-04 04:10:56,776 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations.
[2018-02-04 04:10:56,808 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-04 04:10:56,808 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-04 04:10:56,808 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-04 04:10:56,808 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-04 04:10:56,808 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-04 04:10:56,808 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-04 04:10:56,808 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-04 04:10:56,809 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-04 04:10:56,809 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-04 04:10:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states.
[2018-02-04 04:10:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-02-04 04:10:56,830 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:56,830 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:10:56,831 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1616503521, now seen corresponding path program 1 times
[2018-02-04 04:10:56,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:56,837 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:56,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:56,880 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:56,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:56,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:56,973 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 04:10:56,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:10:56,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-04 04:10:56,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-02-04 04:10:56,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-02-04 04:10:56,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-02-04 04:10:56,996 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states.
[2018-02-04 04:10:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:57,017 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions.
[2018-02-04 04:10:57,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-02-04 04:10:57,018 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11
[2018-02-04 04:10:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:57,151 INFO L225 Difference]: With dead ends: 65
[2018-02-04 04:10:57,151 INFO L226 Difference]: Without dead ends: 57
[2018-02-04 04:10:57,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-02-04 04:10:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-02-04 04:10:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2018-02-04 04:10:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-02-04 04:10:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions.
[2018-02-04 04:10:57,197 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 11
[2018-02-04 04:10:57,197 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:57,197 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions.
[2018-02-04 04:10:57,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-02-04 04:10:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions.
[2018-02-04 04:10:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-04 04:10:57,198 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:57,198 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:10:57,198 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2050647052, now seen corresponding path program 1 times
[2018-02-04 04:10:57,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:57,199 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:57,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,200 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:57,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:57,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:57,313 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 04:10:57,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:10:57,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 04:10:57,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 04:10:57,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 04:10:57,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:10:57,315 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states.
[2018-02-04 04:10:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:57,456 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions.
[2018-02-04 04:10:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 04:10:57,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2018-02-04 04:10:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:57,458 INFO L225 Difference]: With dead ends: 75
[2018-02-04 04:10:57,458 INFO L226 Difference]: Without dead ends: 75
[2018-02-04 04:10:57,458 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 04:10:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2018-02-04 04:10:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64.
[2018-02-04 04:10:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2018-02-04 04:10:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions.
[2018-02-04 04:10:57,462 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 14
[2018-02-04 04:10:57,462 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:57,463 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions.
[2018-02-04 04:10:57,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 04:10:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions.
[2018-02-04 04:10:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-04 04:10:57,463 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:57,463 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 04:10:57,464 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:57,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2050647053, now seen corresponding path program 1 times
[2018-02-04 04:10:57,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:57,464 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:57,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:57,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:57,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:57,548 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 04:10:57,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:10:57,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 04:10:57,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 04:10:57,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 04:10:57,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:10:57,550 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states.
[2018-02-04 04:10:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:57,677 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions.
[2018-02-04 04:10:57,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 04:10:57,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2018-02-04 04:10:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:57,679 INFO L225 Difference]: With dead ends: 82
[2018-02-04 04:10:57,680 INFO L226 Difference]: Without dead ends: 82
[2018-02-04 04:10:57,680 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 04:10:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-02-04 04:10:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74.
[2018-02-04 04:10:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2018-02-04 04:10:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions.
[2018-02-04 04:10:57,686 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 14
[2018-02-04 04:10:57,687 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:57,687 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions.
[2018-02-04 04:10:57,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 04:10:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions.
[2018-02-04 04:10:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-04 04:10:57,688 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:57,688 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 04:10:57,688 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1493222104, now seen corresponding path program 1 times
[2018-02-04 04:10:57,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:57,688 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:57,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,689 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:57,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:57,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:57,735 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 04:10:57,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:10:57,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 04:10:57,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 04:10:57,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 04:10:57,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 04:10:57,737 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 5 states.
[2018-02-04 04:10:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:57,787 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions.
[2018-02-04 04:10:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 04:10:57,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23
[2018-02-04 04:10:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:57,788 INFO L225 Difference]: With dead ends: 78
[2018-02-04 04:10:57,788 INFO L226 Difference]: Without dead ends: 78
[2018-02-04 04:10:57,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-04 04:10:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2018-02-04 04:10:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74.
[2018-02-04 04:10:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2018-02-04 04:10:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions.
[2018-02-04 04:10:57,792 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 23
[2018-02-04 04:10:57,792 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:57,792 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions.
[2018-02-04 04:10:57,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 04:10:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions.
[2018-02-04 04:10:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-04 04:10:57,793 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:57,793 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]
[2018-02-04 04:10:57,793 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash -458760131, now seen corresponding path program 1 times
[2018-02-04 04:10:57,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:57,793 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:57,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:57,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:57,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:57,952 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 04:10:57,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:10:57,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:10:57,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:57,990 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:10:58,059 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 04:10:58,061 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 04:10:58,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,068 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 04:10:58,070 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 04:10:58,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,074 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18
[2018-02-04 04:10:58,105 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 04:10:58,107 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 04:10:58,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,113 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 04:10:58,114 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 04:10:58,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:58,123 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 04:10:58,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7
[2018-02-04 04:10:58,136 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 04:10:58,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:10:58,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12
[2018-02-04 04:10:58,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-04 04:10:58,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-04 04:10:58,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2018-02-04 04:10:58,137 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states.
[2018-02-04 04:10:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:58,372 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions.
[2018-02-04 04:10:58,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-04 04:10:58,373 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25
[2018-02-04 04:10:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:58,374 INFO L225 Difference]: With dead ends: 105
[2018-02-04 04:10:58,374 INFO L226 Difference]: Without dead ends: 105
[2018-02-04 04:10:58,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342
[2018-02-04 04:10:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2018-02-04 04:10:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83.
[2018-02-04 04:10:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-02-04 04:10:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions.
[2018-02-04 04:10:58,379 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 25
[2018-02-04 04:10:58,380 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:58,380 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions.
[2018-02-04 04:10:58,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-04 04:10:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions.
[2018-02-04 04:10:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-04 04:10:58,381 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:58,381 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]
[2018-02-04 04:10:58,381 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:58,381 INFO L82 PathProgramCache]: Analyzing trace with hash -290149679, now seen corresponding path program 1 times
[2018-02-04 04:10:58,381 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:58,381 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:58,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:58,382 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:58,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:58,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:10:58,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:10:58,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-04 04:10:58,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-04 04:10:58,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-04 04:10:58,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-02-04 04:10:58,434 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 7 states.
[2018-02-04 04:10:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:58,572 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions.
[2018-02-04 04:10:58,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-04 04:10:58,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25
[2018-02-04 04:10:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:58,573 INFO L225 Difference]: With dead ends: 87
[2018-02-04 04:10:58,573 INFO L226 Difference]: Without dead ends: 87
[2018-02-04 04:10:58,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2018-02-04 04:10:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2018-02-04 04:10:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81.
[2018-02-04 04:10:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-04 04:10:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions.
[2018-02-04 04:10:58,578 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 25
[2018-02-04 04:10:58,578 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:58,578 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions.
[2018-02-04 04:10:58,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-04 04:10:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions.
[2018-02-04 04:10:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-04 04:10:58,579 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:58,579 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]
[2018-02-04 04:10:58,579 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash -290149678, now seen corresponding path program 1 times
[2018-02-04 04:10:58,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:58,580 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:58,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:58,581 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:58,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:58,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 04:10:58,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 04:10:58,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-04 04:10:58,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-04 04:10:58,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-04 04:10:58,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-02-04 04:10:58,662 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 7 states.
[2018-02-04 04:10:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:58,803 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions.
[2018-02-04 04:10:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-04 04:10:58,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25
[2018-02-04 04:10:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:58,804 INFO L225 Difference]: With dead ends: 95
[2018-02-04 04:10:58,804 INFO L226 Difference]: Without dead ends: 95
[2018-02-04 04:10:58,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156
[2018-02-04 04:10:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-04 04:10:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70.
[2018-02-04 04:10:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2018-02-04 04:10:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions.
[2018-02-04 04:10:58,807 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 25
[2018-02-04 04:10:58,807 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:58,807 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions.
[2018-02-04 04:10:58,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-04 04:10:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions.
[2018-02-04 04:10:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-04 04:10:58,807 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:58,807 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]
[2018-02-04 04:10:58,807 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1498253566, now seen corresponding path program 1 times
[2018-02-04 04:10:58,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:58,808 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:58,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:58,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:58,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:58,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-04 04:10:58,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-04 04:10:58,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP
[2018-02-04 04:10:58,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:58,982 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-04 04:10:59,022 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 04:10:59,023 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 04:10:59,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:59,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:59,030 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 04:10:59,031 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 04:10:59,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:59,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:59,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-04 04:10:59,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18
[2018-02-04 04:10:59,061 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 04:10:59,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12
[2018-02-04 04:10:59,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-04 04:10:59,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-04 04:10:59,074 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 04:10:59,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12
[2018-02-04 04:10:59,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-04 04:10:59,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-04 04:10:59,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-04 04:10:59,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:16
[2018-02-04 04:10:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-04 04:10:59,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-04 04:10:59,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 18
[2018-02-04 04:10:59,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-04 04:10:59,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-04 04:10:59,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306
[2018-02-04 04:10:59,126 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 18 states.
[2018-02-04 04:10:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 04:10:59,392 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions.
[2018-02-04 04:10:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-04 04:10:59,392 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34
[2018-02-04 04:10:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 04:10:59,393 INFO L225 Difference]: With dead ends: 91
[2018-02-04 04:10:59,393 INFO L226 Difference]: Without dead ends: 91
[2018-02-04 04:10:59,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756
[2018-02-04 04:10:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2018-02-04 04:10:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79.
[2018-02-04 04:10:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states.
[2018-02-04 04:10:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions.
[2018-02-04 04:10:59,397 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 34
[2018-02-04 04:10:59,398 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 04:10:59,398 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions.
[2018-02-04 04:10:59,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-04 04:10:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions.
[2018-02-04 04:10:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-04 04:10:59,398 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 04:10:59,399 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]
[2018-02-04 04:10:59,399 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]===
[2018-02-04 04:10:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash -798781214, now seen corresponding path program 1 times
[2018-02-04 04:10:59,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY
[2018-02-04 04:10:59,399 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy
[2018-02-04 04:10:59,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:59,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-04 04:10:59,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-04 04:10:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 04:10:59,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 04:10:59,414 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.UnsupportedOperationException: Unknown lemma type!
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220)
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201)
at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.<init>(NestedInterpolantsBuilder.java:164)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.<init>(InterpolatingTraceCheckCraig.java:106)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:68)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:115)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55)
[2018-02-04 04:10:59,418 INFO L168 Benchmark]: Toolchain (without parser) took 3062.17 ms. Allocated memory was 397.9 MB in the beginning and 686.3 MB in the end (delta: 288.4 MB). Free memory was 354.6 MB in the beginning and 600.8 MB in the end (delta: -246.2 MB). Peak memory consumption was 42.2 MB. Max. memory is 5.3 GB.
[2018-02-04 04:10:59,419 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-04 04:10:59,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.40 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 344.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
[2018-02-04 04:10:59,420 INFO L168 Benchmark]: Boogie Preprocessor took 25.26 ms. Allocated memory is still 397.9 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB.
[2018-02-04 04:10:59,420 INFO L168 Benchmark]: RCFGBuilder took 220.70 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 318.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB.
[2018-02-04 04:10:59,420 INFO L168 Benchmark]: TraceAbstraction took 2655.70 ms. Allocated memory was 397.9 MB in the beginning and 686.3 MB in the end (delta: 288.4 MB). Free memory was 317.5 MB in the beginning and 600.8 MB in the end (delta: -283.3 MB). Peak memory consumption was 5.1 MB. Max. memory is 5.3 GB.
[2018-02-04 04:10:59,422 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.18 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 157.40 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 344.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 25.26 ms. Allocated memory is still 397.9 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 220.70 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 318.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 2655.70 ms. Allocated memory was 397.9 MB in the beginning and 686.3 MB in the end (delta: 288.4 MB). Free memory was 317.5 MB in the beginning and 600.8 MB in the end (delta: -283.3 MB). Peak memory consumption was 5.1 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type!
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-10-59-428.csv
Received shutdown request...