java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 10:33:32,766 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 10:33:32,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 10:33:32,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 10:33:32,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 10:33:32,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 10:33:32,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 10:33:32,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 10:33:32,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 10:33:32,788 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 10:33:32,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 10:33:32,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 10:33:32,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 10:33:32,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 10:33:32,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 10:33:32,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 10:33:32,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 10:33:32,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 10:33:32,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 10:33:32,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 10:33:32,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 10:33:32,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 10:33:32,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 10:33:32,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 10:33:32,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 10:33:32,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 10:33:32,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 10:33:32,804 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 10:33:32,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 10:33:32,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 10:33:32,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 10:33:32,805 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf
[2018-02-02 10:33:32,814 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 10:33:32,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 10:33:32,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 10:33:32,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 10:33:32,816 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 10:33:32,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 10:33:32,816 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 10:33:32,816 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 10:33:32,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 10:33:32,817 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 10:33:32,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 10:33:32,817 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 10:33:32,817 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 10:33:32,817 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 10:33:32,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 10:33:32,818 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 10:33:32,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 10:33:32,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 10:33:32,818 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 10:33:32,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 10:33:32,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:33:32,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 10:33:32,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-02 10:33:32,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 10:33:32,853 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 10:33:32,856 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 10:33:32,857 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 10:33:32,857 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 10:33:32,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i
[2018-02-02 10:33:32,981 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 10:33:32,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 10:33:32,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 10:33:32,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 10:33:32,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 10:33:32,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:33:32" (1/1) ...
[2018-02-02 10:33:32,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd3f7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:32, skipping insertion in model container
[2018-02-02 10:33:32,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:33:32" (1/1) ...
[2018-02-02 10:33:33,001 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:33:33,034 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:33:33,127 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:33:33,142 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:33:33,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33 WrapperNode
[2018-02-02 10:33:33,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 10:33:33,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 10:33:33,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 10:33:33,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 10:33:33,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
[2018-02-02 10:33:33,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
[2018-02-02 10:33:33,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
[2018-02-02 10:33:33,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
[2018-02-02 10:33:33,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
[2018-02-02 10:33:33,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
[2018-02-02 10:33:33,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
[2018-02-02 10:33:33,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 10:33:33,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 10:33:33,182 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 10:33:33,182 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 10:33:33,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:33:33,221 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 10:33:33,222 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 10:33:33,222 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 10:33:33,222 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 10:33:33,223 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-02-02 10:33:33,223 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 10:33:33,223 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 10:33:33,223 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 10:33:33,561 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 10:33:33,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:33:33 BoogieIcfgContainer
[2018-02-02 10:33:33,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 10:33:33,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 10:33:33,562 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 10:33:33,564 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 10:33:33,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:33:32" (1/3) ...
[2018-02-02 10:33:33,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa88cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:33:33, skipping insertion in model container
[2018-02-02 10:33:33,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:33" (2/3) ...
[2018-02-02 10:33:33,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa88cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:33:33, skipping insertion in model container
[2018-02-02 10:33:33,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:33:33" (3/3) ...
[2018-02-02 10:33:33,567 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-token_true-unreach-call_true-valid-memsafety.i
[2018-02-02 10:33:33,572 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 10:33:33,577 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations.
[2018-02-02 10:33:33,601 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 10:33:33,601 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 10:33:33,602 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-02 10:33:33,602 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 10:33:33,602 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 10:33:33,602 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 10:33:33,602 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 10:33:33,602 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 10:33:33,603 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 10:33:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states.
[2018-02-02 10:33:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 10:33:33,620 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:33,621 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:33,621 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775718, now seen corresponding path program 1 times
[2018-02-02 10:33:33,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:33,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:33,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:33,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 10:33:33,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:33,748 INFO L182 omatonBuilderFactory]: Interpolants [117#true, 118#false, 119#(= 1 (select |#valid| |main_#t~malloc0.base|)), 120#(= 1 (select |#valid| main_~head~0.base))]
[2018-02-02 10:33:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:33,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:33:33,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:33:33,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:33:33,764 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states.
[2018-02-02 10:33:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:33,985 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions.
[2018-02-02 10:33:33,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:33:33,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 10:33:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:33,993 INFO L225 Difference]: With dead ends: 136
[2018-02-02 10:33:33,993 INFO L226 Difference]: Without dead ends: 133
[2018-02-02 10:33:33,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:33:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2018-02-02 10:33:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109.
[2018-02-02 10:33:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2018-02-02 10:33:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions.
[2018-02-02 10:33:34,023 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 8
[2018-02-02 10:33:34,023 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:34,023 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions.
[2018-02-02 10:33:34,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:33:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions.
[2018-02-02 10:33:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 10:33:34,024 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:34,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:34,024 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775717, now seen corresponding path program 1 times
[2018-02-02 10:33:34,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:34,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:34,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 10:33:34,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,090 INFO L182 omatonBuilderFactory]: Interpolants [368#true, 369#false, 370#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 371#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))]
[2018-02-02 10:33:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:33:34,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:33:34,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:33:34,092 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 4 states.
[2018-02-02 10:33:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:34,159 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions.
[2018-02-02 10:33:34,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:33:34,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 10:33:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:34,160 INFO L225 Difference]: With dead ends: 131
[2018-02-02 10:33:34,161 INFO L226 Difference]: Without dead ends: 131
[2018-02-02 10:33:34,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:33:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2018-02-02 10:33:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107.
[2018-02-02 10:33:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2018-02-02 10:33:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions.
[2018-02-02 10:33:34,168 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 8
[2018-02-02 10:33:34,168 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:34,168 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions.
[2018-02-02 10:33:34,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:33:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions.
[2018-02-02 10:33:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-02 10:33:34,169 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:34,169 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:34,169 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075710, now seen corresponding path program 1 times
[2018-02-02 10:33:34,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:34,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:34,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 10:33:34,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,212 INFO L182 omatonBuilderFactory]: Interpolants [612#true, 613#false, 614#(= 1 (select |#valid| main_~head~0.base)), 615#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:33:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:33:34,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:33:34,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:33:34,213 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 4 states.
[2018-02-02 10:33:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:34,324 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions.
[2018-02-02 10:33:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:33:34,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2018-02-02 10:33:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:34,325 INFO L225 Difference]: With dead ends: 111
[2018-02-02 10:33:34,325 INFO L226 Difference]: Without dead ends: 111
[2018-02-02 10:33:34,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:33:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2018-02-02 10:33:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98.
[2018-02-02 10:33:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states.
[2018-02-02 10:33:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions.
[2018-02-02 10:33:34,331 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 14
[2018-02-02 10:33:34,331 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:34,331 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions.
[2018-02-02 10:33:34,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:33:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions.
[2018-02-02 10:33:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-02 10:33:34,332 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:34,332 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:34,332 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075709, now seen corresponding path program 1 times
[2018-02-02 10:33:34,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:34,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:34,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:33:34,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,401 INFO L182 omatonBuilderFactory]: Interpolants [827#true, 828#false, 829#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 830#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 831#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))]
[2018-02-02 10:33:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:33:34,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:33:34,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:33:34,402 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 5 states.
[2018-02-02 10:33:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:34,538 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions.
[2018-02-02 10:33:34,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:33:34,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2018-02-02 10:33:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:34,539 INFO L225 Difference]: With dead ends: 166
[2018-02-02 10:33:34,540 INFO L226 Difference]: Without dead ends: 166
[2018-02-02 10:33:34,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:33:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states.
[2018-02-02 10:33:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131.
[2018-02-02 10:33:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2018-02-02 10:33:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions.
[2018-02-02 10:33:34,547 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 14
[2018-02-02 10:33:34,547 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:34,547 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions.
[2018-02-02 10:33:34,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:33:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions.
[2018-02-02 10:33:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 10:33:34,548 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:34,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:34,548 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -444857017, now seen corresponding path program 1 times
[2018-02-02 10:33:34,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:34,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:34,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:33:34,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:34,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-02 10:33:34,637 INFO L182 omatonBuilderFactory]: Interpolants [1136#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1137#(and (= |main_#t~mem11.offset| 0) (= (select |#length| |main_#t~mem11.base|) 8)), 1133#true, 1134#false, 1135#(and (= 0 |main_#t~malloc9.offset|) (= 8 (select |#length| |main_#t~malloc9.base|)))]
[2018-02-02 10:33:34,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-02 10:33:34,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:33:34,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:33:34,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:33:34,638 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 5 states.
[2018-02-02 10:33:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:34,833 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions.
[2018-02-02 10:33:34,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:33:34,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 10:33:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:34,834 INFO L225 Difference]: With dead ends: 130
[2018-02-02 10:33:34,834 INFO L226 Difference]: Without dead ends: 130
[2018-02-02 10:33:34,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:33:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2018-02-02 10:33:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130.
[2018-02-02 10:33:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states.
[2018-02-02 10:33:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions.
[2018-02-02 10:33:34,840 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 18
[2018-02-02 10:33:34,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:34,840 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions.
[2018-02-02 10:33:34,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:33:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions.
[2018-02-02 10:33:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 10:33:34,841 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:34,841 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:34,841 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:34,841 INFO L82 PathProgramCache]: Analyzing trace with hash -444857018, now seen corresponding path program 1 times
[2018-02-02 10:33:34,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:34,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:34,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:33:34,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,903 INFO L182 omatonBuilderFactory]: Interpolants [1408#(= 1 (select |#valid| |main_#t~mem11.base|)), 1404#true, 1405#false, 1406#(= 1 (select |#valid| |main_#t~malloc9.base|)), 1407#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))]
[2018-02-02 10:33:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:34,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:33:34,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:33:34,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:33:34,904 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 5 states.
[2018-02-02 10:33:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:34,979 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions.
[2018-02-02 10:33:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:33:34,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 10:33:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:34,980 INFO L225 Difference]: With dead ends: 131
[2018-02-02 10:33:34,980 INFO L226 Difference]: Without dead ends: 131
[2018-02-02 10:33:34,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:33:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2018-02-02 10:33:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129.
[2018-02-02 10:33:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-02-02 10:33:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions.
[2018-02-02 10:33:34,985 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 18
[2018-02-02 10:33:34,986 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:34,986 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions.
[2018-02-02 10:33:34,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:33:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions.
[2018-02-02 10:33:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 10:33:34,987 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:34,987 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:34,987 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash -418196060, now seen corresponding path program 1 times
[2018-02-02 10:33:34,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:34,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:35,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:33:35,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,029 INFO L182 omatonBuilderFactory]: Interpolants [1680#(= 1 (select |#valid| main_~x~0.base)), 1675#true, 1676#false, 1677#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1678#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1679#(= 1 (select |#valid| |main_#t~mem6.base|))]
[2018-02-02 10:33:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:33:35,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:33:35,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:33:35,029 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 6 states.
[2018-02-02 10:33:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:35,195 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions.
[2018-02-02 10:33:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:33:35,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2018-02-02 10:33:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:35,200 INFO L225 Difference]: With dead ends: 188
[2018-02-02 10:33:35,200 INFO L226 Difference]: Without dead ends: 188
[2018-02-02 10:33:35,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:33:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2018-02-02 10:33:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128.
[2018-02-02 10:33:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states.
[2018-02-02 10:33:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions.
[2018-02-02 10:33:35,205 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 18
[2018-02-02 10:33:35,205 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:35,205 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions.
[2018-02-02 10:33:35,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:33:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions.
[2018-02-02 10:33:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 10:33:35,206 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:35,206 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:35,206 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:35,206 INFO L82 PathProgramCache]: Analyzing trace with hash -418196059, now seen corresponding path program 1 times
[2018-02-02 10:33:35,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:35,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:35,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:33:35,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,270 INFO L182 omatonBuilderFactory]: Interpolants [2004#true, 2005#false, 2006#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2007#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2008#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 2009#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))]
[2018-02-02 10:33:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:33:35,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:33:35,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:33:35,271 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 6 states.
[2018-02-02 10:33:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:35,455 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions.
[2018-02-02 10:33:35,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:33:35,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2018-02-02 10:33:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:35,456 INFO L225 Difference]: With dead ends: 210
[2018-02-02 10:33:35,456 INFO L226 Difference]: Without dead ends: 210
[2018-02-02 10:33:35,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:33:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2018-02-02 10:33:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 112.
[2018-02-02 10:33:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2018-02-02 10:33:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions.
[2018-02-02 10:33:35,461 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 18
[2018-02-02 10:33:35,461 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:35,461 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions.
[2018-02-02 10:33:35,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:33:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions.
[2018-02-02 10:33:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 10:33:35,462 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:35,462 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-02 10:33:35,462 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379848, now seen corresponding path program 1 times
[2018-02-02 10:33:35,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:35,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:35,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-02 10:33:35,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,564 INFO L182 omatonBuilderFactory]: Interpolants [2352#(= 1 (select |#valid| |main_#t~mem17.base|)), 2353#(= 1 (select |#valid| main_~x~0.base)), 2343#true, 2344#false, 2345#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 2346#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 2347#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 2348#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base)), 2349#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 2350#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 2351#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))]
[2018-02-02 10:33:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:35,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:33:35,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:33:35,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:33:35,565 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 11 states.
[2018-02-02 10:33:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:35,905 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions.
[2018-02-02 10:33:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-02 10:33:35,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33
[2018-02-02 10:33:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:35,906 INFO L225 Difference]: With dead ends: 196
[2018-02-02 10:33:35,907 INFO L226 Difference]: Without dead ends: 196
[2018-02-02 10:33:35,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:33:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2018-02-02 10:33:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135.
[2018-02-02 10:33:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-02-02 10:33:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions.
[2018-02-02 10:33:35,910 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 33
[2018-02-02 10:33:35,911 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:35,911 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions.
[2018-02-02 10:33:35,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:33:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions.
[2018-02-02 10:33:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 10:33:35,912 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:35,912 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-02 10:33:35,912 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379847, now seen corresponding path program 1 times
[2018-02-02 10:33:35,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:35,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:36,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:36,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-02 10:33:36,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:36,055 INFO L182 omatonBuilderFactory]: Interpolants [2704#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 2705#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2706#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2707#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2708#(and (= 8 (select |#length| |main_#t~mem17.base|)) (= 0 |main_#t~mem17.offset|)), 2709#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 2699#true, 2700#false, 2701#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 2702#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 2703#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| |main_#t~malloc9.base|)) (= main_~x~0.base main_~head~0.base))]
[2018-02-02 10:33:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:36,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:33:36,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:33:36,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:33:36,056 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 11 states.
[2018-02-02 10:33:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:36,576 INFO L93 Difference]: Finished difference Result 226 states and 232 transitions.
[2018-02-02 10:33:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 10:33:36,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33
[2018-02-02 10:33:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:36,578 INFO L225 Difference]: With dead ends: 226
[2018-02-02 10:33:36,578 INFO L226 Difference]: Without dead ends: 226
[2018-02-02 10:33:36,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:33:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2018-02-02 10:33:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 135.
[2018-02-02 10:33:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-02-02 10:33:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions.
[2018-02-02 10:33:36,581 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 33
[2018-02-02 10:33:36,582 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:36,582 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions.
[2018-02-02 10:33:36,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:33:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions.
[2018-02-02 10:33:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 10:33:36,583 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:36,583 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:36,583 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 713889595, now seen corresponding path program 1 times
[2018-02-02 10:33:36,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:36,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:36,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:36,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:33:36,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:36,698 INFO L182 omatonBuilderFactory]: Interpolants [3085#true, 3086#false, 3087#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 3088#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 3089#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 3090#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base)), 3091#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 3092#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3093#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3094#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 3095#(or (not (= 0 |main_#t~mem14|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 3096#(= 1 (select |#valid| |main_#t~mem15.base|)), 3097#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:33:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:36,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:33:36,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:33:36,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:33:36,699 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 13 states.
[2018-02-02 10:33:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:37,079 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions.
[2018-02-02 10:33:37,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 10:33:37,079 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33
[2018-02-02 10:33:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:37,080 INFO L225 Difference]: With dead ends: 198
[2018-02-02 10:33:37,080 INFO L226 Difference]: Without dead ends: 198
[2018-02-02 10:33:37,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:33:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2018-02-02 10:33:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 143.
[2018-02-02 10:33:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states.
[2018-02-02 10:33:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions.
[2018-02-02 10:33:37,089 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 33
[2018-02-02 10:33:37,089 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:37,089 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions.
[2018-02-02 10:33:37,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:33:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions.
[2018-02-02 10:33:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 10:33:37,090 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:37,091 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:37,091 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash 713889596, now seen corresponding path program 1 times
[2018-02-02 10:33:37,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:37,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:37,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:37,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:33:37,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:37,254 INFO L182 omatonBuilderFactory]: Interpolants [3457#true, 3458#false, 3459#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 3460#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 3461#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| |main_#t~malloc9.base|)) (= main_~x~0.base main_~head~0.base)), 3462#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 3463#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3464#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3465#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3466#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 3467#(or (not (= 0 |main_#t~mem14|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 3468#(and (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 3469#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))]
[2018-02-02 10:33:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:37,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:33:37,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:33:37,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:33:37,255 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 13 states.
[2018-02-02 10:33:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:37,696 INFO L93 Difference]: Finished difference Result 238 states and 245 transitions.
[2018-02-02 10:33:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 10:33:37,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33
[2018-02-02 10:33:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:37,697 INFO L225 Difference]: With dead ends: 238
[2018-02-02 10:33:37,697 INFO L226 Difference]: Without dead ends: 238
[2018-02-02 10:33:37,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:33:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2018-02-02 10:33:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 141.
[2018-02-02 10:33:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states.
[2018-02-02 10:33:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions.
[2018-02-02 10:33:37,700 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 33
[2018-02-02 10:33:37,700 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:37,700 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions.
[2018-02-02 10:33:37,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:33:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions.
[2018-02-02 10:33:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 10:33:37,701 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:37,701 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]
[2018-02-02 10:33:37,701 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:37,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2119038797, now seen corresponding path program 1 times
[2018-02-02 10:33:37,702 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:37,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:37,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:37,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:33:37,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:37,956 INFO L182 omatonBuilderFactory]: Interpolants [3872#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 3873#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~mem11.base| main_~head~0.base)) (= main_~head~0.offset |main_#t~mem11.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3874#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 2) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3875#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3876#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 3877#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem14|))), 3878#(and (= (select (select |#memory_int| |main_#t~mem15.base|) (+ 0 4)) 2) (= 0 |main_#t~mem15.offset|)), 3879#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 2), 3880#(and (= |main_#t~mem13| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 2)), 3865#true, 3866#false, 3867#(= 0 |main_#t~malloc0.offset|), 3868#(= main_~head~0.offset 0), 3869#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 3870#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 3871#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0))]
[2018-02-02 10:33:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:37,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:33:37,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:33:37,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:33:37,957 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 16 states.
[2018-02-02 10:33:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:38,486 INFO L93 Difference]: Finished difference Result 219 states and 224 transitions.
[2018-02-02 10:33:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:33:38,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42
[2018-02-02 10:33:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:38,487 INFO L225 Difference]: With dead ends: 219
[2018-02-02 10:33:38,487 INFO L226 Difference]: Without dead ends: 219
[2018-02-02 10:33:38,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=904, Unknown=0, NotChecked=0, Total=1190
[2018-02-02 10:33:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states.
[2018-02-02 10:33:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 158.
[2018-02-02 10:33:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states.
[2018-02-02 10:33:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions.
[2018-02-02 10:33:38,491 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 42
[2018-02-02 10:33:38,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:38,491 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions.
[2018-02-02 10:33:38,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:33:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions.
[2018-02-02 10:33:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 10:33:38,492 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:38,492 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:38,492 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash -298659056, now seen corresponding path program 2 times
[2018-02-02 10:33:38,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:38,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:38,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:38,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:33:38,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:38,704 INFO L182 omatonBuilderFactory]: Interpolants [4296#true, 4297#false, 4298#(= 0 |main_#t~malloc0.offset|), 4299#(= main_~head~0.offset 0), 4300#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 4301#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 4302#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 4303#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 4304#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~mem11.base| main_~head~0.base)) (= main_~head~0.offset |main_#t~mem11.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4305#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 2) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4306#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4307#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 4308#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem14|))), 4309#(and (= (select (select |#memory_int| |main_#t~mem15.base|) (+ 0 4)) 2) (= 0 |main_#t~mem15.offset|)), 4310#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 2), 4311#(= |main_#t~mem14| 2)]
[2018-02-02 10:33:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:38,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:33:38,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:33:38,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:33:38,704 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 16 states.
[2018-02-02 10:33:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:39,156 INFO L93 Difference]: Finished difference Result 204 states and 208 transitions.
[2018-02-02 10:33:39,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:33:39,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42
[2018-02-02 10:33:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:39,157 INFO L225 Difference]: With dead ends: 204
[2018-02-02 10:33:39,157 INFO L226 Difference]: Without dead ends: 192
[2018-02-02 10:33:39,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992
[2018-02-02 10:33:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2018-02-02 10:33:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135.
[2018-02-02 10:33:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states.
[2018-02-02 10:33:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions.
[2018-02-02 10:33:39,161 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 42
[2018-02-02 10:33:39,161 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:39,161 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions.
[2018-02-02 10:33:39,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:33:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions.
[2018-02-02 10:33:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:33:39,162 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:39,162 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, 1]
[2018-02-02 10:33:39,162 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1802626187, now seen corresponding path program 1 times
[2018-02-02 10:33:39,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:39,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:39,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:39,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:33:39,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:39,349 INFO L182 omatonBuilderFactory]: Interpolants [4683#true, 4684#false, 4685#(not (= 0 |main_#t~malloc0.base|)), 4686#(not (= 0 main_~head~0.base)), 4687#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4688#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4689#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4690#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4691#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 4692#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 4693#(and (not (= main_~head~0.base |main_#t~mem17.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem17.base|) (not (= 0 main_~head~0.base))), 4694#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~head~0.base))), 4695#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 4696#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base))), 4697#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~head~0.base))), 4698#(and (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem20.base|)) (not (= 0 main_~head~0.base))), 4699#(and (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= 0 main_~head~0.base))), 4700#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:33:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:39,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:33:39,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:33:39,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:33:39,350 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 18 states.
[2018-02-02 10:33:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:39,768 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions.
[2018-02-02 10:33:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:33:39,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44
[2018-02-02 10:33:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:39,768 INFO L225 Difference]: With dead ends: 213
[2018-02-02 10:33:39,768 INFO L226 Difference]: Without dead ends: 213
[2018-02-02 10:33:39,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190
[2018-02-02 10:33:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2018-02-02 10:33:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146.
[2018-02-02 10:33:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2018-02-02 10:33:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions.
[2018-02-02 10:33:39,771 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 44
[2018-02-02 10:33:39,771 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:39,771 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions.
[2018-02-02 10:33:39,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:33:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions.
[2018-02-02 10:33:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:33:39,771 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:39,772 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, 1]
[2018-02-02 10:33:39,772 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1802626186, now seen corresponding path program 1 times
[2018-02-02 10:33:39,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:39,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:39,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:39,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:33:39,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:39,922 INFO L182 omatonBuilderFactory]: Interpolants [5094#true, 5095#false, 5096#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5097#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5098#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5099#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 5100#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5101#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 5102#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 5103#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem17.offset|) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5104#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5105#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5106#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5107#(and (= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|))), 5108#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))]
[2018-02-02 10:33:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:39,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:33:39,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:33:39,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:33:39,923 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 15 states.
[2018-02-02 10:33:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:40,342 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions.
[2018-02-02 10:33:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:33:40,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44
[2018-02-02 10:33:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:40,343 INFO L225 Difference]: With dead ends: 189
[2018-02-02 10:33:40,343 INFO L226 Difference]: Without dead ends: 189
[2018-02-02 10:33:40,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702
[2018-02-02 10:33:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2018-02-02 10:33:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 148.
[2018-02-02 10:33:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states.
[2018-02-02 10:33:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions.
[2018-02-02 10:33:40,346 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 44
[2018-02-02 10:33:40,346 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:40,346 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions.
[2018-02-02 10:33:40,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:33:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions.
[2018-02-02 10:33:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:33:40,346 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:40,346 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]
[2018-02-02 10:33:40,346 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1061401105, now seen corresponding path program 1 times
[2018-02-02 10:33:40,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:40,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:40,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:40,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:33:40,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:40,469 INFO L182 omatonBuilderFactory]: Interpolants [5472#(= (select |#valid| main_~head~0.base) 1), 5473#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5474#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 5475#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5476#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 5477#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 5478#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))), 5479#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 5480#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 5481#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5482#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5483#(= 1 (select |#valid| |main_#t~mem17.base|)), 5484#(= 1 (select |#valid| main_~x~0.base)), 5470#true, 5471#false]
[2018-02-02 10:33:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:40,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:33:40,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:33:40,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:33:40,469 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 15 states.
[2018-02-02 10:33:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:40,894 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions.
[2018-02-02 10:33:40,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:33:40,895 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44
[2018-02-02 10:33:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:40,895 INFO L225 Difference]: With dead ends: 243
[2018-02-02 10:33:40,895 INFO L226 Difference]: Without dead ends: 243
[2018-02-02 10:33:40,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:33:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states.
[2018-02-02 10:33:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 179.
[2018-02-02 10:33:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states.
[2018-02-02 10:33:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions.
[2018-02-02 10:33:40,898 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 44
[2018-02-02 10:33:40,898 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:40,898 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions.
[2018-02-02 10:33:40,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:33:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions.
[2018-02-02 10:33:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:33:40,898 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:40,898 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]
[2018-02-02 10:33:40,898 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1061401106, now seen corresponding path program 1 times
[2018-02-02 10:33:40,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:40,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:41,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:41,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:33:41,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:41,080 INFO L182 omatonBuilderFactory]: Interpolants [5935#true, 5936#false, 5937#(= (select |#valid| main_~head~0.base) 1), 5938#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5939#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 5940#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5941#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5942#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5943#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5944#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base))), 5945#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5946#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5947#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5948#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5949#(and (= 8 (select |#length| |main_#t~mem17.base|)) (= 0 |main_#t~mem17.offset|)), 5950#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))]
[2018-02-02 10:33:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:41,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:33:41,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:33:41,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:33:41,081 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand 16 states.
[2018-02-02 10:33:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:41,676 INFO L93 Difference]: Finished difference Result 273 states and 286 transitions.
[2018-02-02 10:33:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:33:41,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44
[2018-02-02 10:33:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:41,677 INFO L225 Difference]: With dead ends: 273
[2018-02-02 10:33:41,677 INFO L226 Difference]: Without dead ends: 273
[2018-02-02 10:33:41,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:33:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2018-02-02 10:33:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 179.
[2018-02-02 10:33:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states.
[2018-02-02 10:33:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions.
[2018-02-02 10:33:41,680 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 191 transitions. Word has length 44
[2018-02-02 10:33:41,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:41,680 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 191 transitions.
[2018-02-02 10:33:41,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:33:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 191 transitions.
[2018-02-02 10:33:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:33:41,680 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:41,680 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]
[2018-02-02 10:33:41,681 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1356296748, now seen corresponding path program 1 times
[2018-02-02 10:33:41,681 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:41,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:41,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:41,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:33:41,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:41,855 INFO L182 omatonBuilderFactory]: Interpolants [6432#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6433#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|))), 6434#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 6435#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))), 6436#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 6437#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 6438#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 6439#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6440#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 6441#(or (not (= 0 |main_#t~mem14|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 6442#(= 1 (select |#valid| |main_#t~mem15.base|)), 6443#(= 1 (select |#valid| main_~x~0.base)), 6427#true, 6428#false, 6429#(= 1 (select |#valid| main_~head~0.base)), 6430#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 6431#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base))]
[2018-02-02 10:33:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:41,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:33:41,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:33:41,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:33:41,856 INFO L87 Difference]: Start difference. First operand 179 states and 191 transitions. Second operand 17 states.
[2018-02-02 10:33:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:42,523 INFO L93 Difference]: Finished difference Result 245 states and 259 transitions.
[2018-02-02 10:33:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:33:42,523 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44
[2018-02-02 10:33:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:42,524 INFO L225 Difference]: With dead ends: 245
[2018-02-02 10:33:42,524 INFO L226 Difference]: Without dead ends: 245
[2018-02-02 10:33:42,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 10:33:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2018-02-02 10:33:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 187.
[2018-02-02 10:33:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states.
[2018-02-02 10:33:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions.
[2018-02-02 10:33:42,527 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 44
[2018-02-02 10:33:42,527 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:42,528 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions.
[2018-02-02 10:33:42,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:33:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions.
[2018-02-02 10:33:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:33:42,528 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:42,528 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]
[2018-02-02 10:33:42,528 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:42,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1356296747, now seen corresponding path program 1 times
[2018-02-02 10:33:42,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:42,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:42,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:42,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:33:42,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:42,815 INFO L182 omatonBuilderFactory]: Interpolants [6912#(= 1 (select |#valid| main_~head~0.base)), 6913#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 6914#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 6915#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6916#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6917#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6918#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6919#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base))), 6920#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6921#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6922#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6923#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6924#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 6925#(or (not (= 0 |main_#t~mem14|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 6926#(and (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 6927#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 6910#true, 6911#false]
[2018-02-02 10:33:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:42,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:33:42,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:33:42,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:33:42,815 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand 18 states.
[2018-02-02 10:33:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:43,723 INFO L93 Difference]: Finished difference Result 285 states and 299 transitions.
[2018-02-02 10:33:43,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:33:43,723 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44
[2018-02-02 10:33:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:43,724 INFO L225 Difference]: With dead ends: 285
[2018-02-02 10:33:43,724 INFO L226 Difference]: Without dead ends: 285
[2018-02-02 10:33:43,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:33:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states.
[2018-02-02 10:33:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 185.
[2018-02-02 10:33:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states.
[2018-02-02 10:33:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions.
[2018-02-02 10:33:43,726 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 44
[2018-02-02 10:33:43,726 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:43,726 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions.
[2018-02-02 10:33:43,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:33:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions.
[2018-02-02 10:33:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-02 10:33:43,727 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:43,727 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:43,727 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1468548595, now seen corresponding path program 1 times
[2018-02-02 10:33:43,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:43,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:43,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:43,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-02 10:33:43,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:43,791 INFO L182 omatonBuilderFactory]: Interpolants [7428#true, 7429#false, 7430#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7431#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7432#(and (= 0 |main_#t~malloc9.offset|) (not (= |main_#t~malloc9.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7433#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 7434#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7435#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 7436#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 7437#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 7438#(= 0 |main_#t~mem22.offset|)]
[2018-02-02 10:33:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:43,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:33:43,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:33:43,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:33:43,792 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 11 states.
[2018-02-02 10:33:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:44,153 INFO L93 Difference]: Finished difference Result 233 states and 240 transitions.
[2018-02-02 10:33:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 10:33:44,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45
[2018-02-02 10:33:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:44,154 INFO L225 Difference]: With dead ends: 233
[2018-02-02 10:33:44,154 INFO L226 Difference]: Without dead ends: 233
[2018-02-02 10:33:44,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:33:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2018-02-02 10:33:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 191.
[2018-02-02 10:33:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states.
[2018-02-02 10:33:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions.
[2018-02-02 10:33:44,158 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 45
[2018-02-02 10:33:44,158 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:44,158 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions.
[2018-02-02 10:33:44,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:33:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions.
[2018-02-02 10:33:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-02 10:33:44,159 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:44,159 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, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:44,159 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1468548594, now seen corresponding path program 1 times
[2018-02-02 10:33:44,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:44,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:44,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 10:33:44,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,215 INFO L182 omatonBuilderFactory]: Interpolants [7888#(= 1 (select |#valid| |main_#t~mem22.base|)), 7881#true, 7882#false, 7883#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7884#(= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 7885#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 7886#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7887#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))]
[2018-02-02 10:33:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:33:44,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:33:44,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:33:44,216 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 8 states.
[2018-02-02 10:33:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:44,383 INFO L93 Difference]: Finished difference Result 240 states and 253 transitions.
[2018-02-02 10:33:44,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:33:44,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45
[2018-02-02 10:33:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:44,386 INFO L225 Difference]: With dead ends: 240
[2018-02-02 10:33:44,386 INFO L226 Difference]: Without dead ends: 240
[2018-02-02 10:33:44,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:33:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states.
[2018-02-02 10:33:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214.
[2018-02-02 10:33:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states.
[2018-02-02 10:33:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 231 transitions.
[2018-02-02 10:33:44,388 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 231 transitions. Word has length 45
[2018-02-02 10:33:44,388 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:44,389 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 231 transitions.
[2018-02-02 10:33:44,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:33:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 231 transitions.
[2018-02-02 10:33:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-02 10:33:44,389 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:44,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:44,389 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:44,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1769046639, now seen corresponding path program 1 times
[2018-02-02 10:33:44,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:44,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:44,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-02 10:33:44,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,523 INFO L182 omatonBuilderFactory]: Interpolants [8352#false, 8353#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 8354#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8355#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= |main_#t~malloc9.base| 0)) (= main_~x~0.base main_~head~0.base)), 8356#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8357#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 8358#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 8359#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0))), 8360#(and (not (= |main_#t~mem22.base| 0)) (= 1 (select (store |#valid| |main_#t~mem22.base| 0) main_~x~0.base))), 8361#(= 1 (select |#valid| main_~x~0.base)), 8351#true]
[2018-02-02 10:33:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:33:44,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:33:44,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:33:44,524 INFO L87 Difference]: Start difference. First operand 214 states and 231 transitions. Second operand 11 states.
[2018-02-02 10:33:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:44,823 INFO L93 Difference]: Finished difference Result 236 states and 252 transitions.
[2018-02-02 10:33:44,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 10:33:44,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47
[2018-02-02 10:33:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:44,824 INFO L225 Difference]: With dead ends: 236
[2018-02-02 10:33:44,824 INFO L226 Difference]: Without dead ends: 236
[2018-02-02 10:33:44,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:33:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states.
[2018-02-02 10:33:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 216.
[2018-02-02 10:33:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states.
[2018-02-02 10:33:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 233 transitions.
[2018-02-02 10:33:44,827 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 233 transitions. Word has length 47
[2018-02-02 10:33:44,827 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:44,827 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 233 transitions.
[2018-02-02 10:33:44,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:33:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 233 transitions.
[2018-02-02 10:33:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 10:33:44,827 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:44,827 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:44,828 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:44,828 INFO L82 PathProgramCache]: Analyzing trace with hash 549503799, now seen corresponding path program 1 times
[2018-02-02 10:33:44,828 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:44,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:44,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:33:44,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,944 INFO L182 omatonBuilderFactory]: Interpolants [8832#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8833#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 8834#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 8835#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 8836#(= 0 |main_#t~mem20.offset|), 8837#(= 0 main_~x~0.offset), 8838#(= main_~head~0.offset 0), 8826#true, 8827#false, 8828#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 8829#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8830#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 8831#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))]
[2018-02-02 10:33:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:44,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:33:44,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:33:44,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:33:44,945 INFO L87 Difference]: Start difference. First operand 216 states and 233 transitions. Second operand 13 states.
[2018-02-02 10:33:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:45,224 INFO L93 Difference]: Finished difference Result 247 states and 258 transitions.
[2018-02-02 10:33:45,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 10:33:45,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48
[2018-02-02 10:33:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:45,225 INFO L225 Difference]: With dead ends: 247
[2018-02-02 10:33:45,225 INFO L226 Difference]: Without dead ends: 247
[2018-02-02 10:33:45,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:33:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2018-02-02 10:33:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212.
[2018-02-02 10:33:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states.
[2018-02-02 10:33:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions.
[2018-02-02 10:33:45,227 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 48
[2018-02-02 10:33:45,227 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:45,227 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions.
[2018-02-02 10:33:45,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:33:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions.
[2018-02-02 10:33:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2018-02-02 10:33:45,228 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:45,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:45,228 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -753223921, now seen corresponding path program 1 times
[2018-02-02 10:33:45,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:45,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:45,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:45,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-02-02 10:33:45,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:45,598 INFO L182 omatonBuilderFactory]: Interpolants [9322#true, 9323#false, 9324#(= |#valid| |old(#valid)|), 9325#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 9326#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 9327#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base)), 9328#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9329#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= |main_#t~malloc9.base| 0)) (= main_~x~0.base main_~head~0.base) (= (store (store |#valid| main_~head~0.base 0) |main_#t~malloc9.base| 0) |old(#valid)|)), 9330#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|)), 9331#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)), 9332#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)), 9333#(and (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 9334#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|)), 9335#(and (not (= |main_#t~mem22.base| main_~x~0.base)) (not (= |main_#t~mem22.base| 0)) (not (= 0 main_~x~0.base)) (= (store (store |#valid| |main_#t~mem22.base| 0) main_~x~0.base 0) |old(#valid)|)), 9336#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|))]
[2018-02-02 10:33:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:45,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:33:45,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:33:45,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:33:45,598 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand 15 states.
[2018-02-02 10:33:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:46,120 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions.
[2018-02-02 10:33:46,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:33:46,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49
[2018-02-02 10:33:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:46,121 INFO L225 Difference]: With dead ends: 225
[2018-02-02 10:33:46,121 INFO L226 Difference]: Without dead ends: 215
[2018-02-02 10:33:46,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:33:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2018-02-02 10:33:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 204.
[2018-02-02 10:33:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states.
[2018-02-02 10:33:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 219 transitions.
[2018-02-02 10:33:46,124 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 219 transitions. Word has length 49
[2018-02-02 10:33:46,124 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:46,124 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 219 transitions.
[2018-02-02 10:33:46,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:33:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 219 transitions.
[2018-02-02 10:33:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-02-02 10:33:46,125 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:46,125 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:46,125 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash -207821991, now seen corresponding path program 2 times
[2018-02-02 10:33:46,125 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:46,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-02-02 10:33:46,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:33:46,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-02 10:33:46,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:46,249 INFO L182 omatonBuilderFactory]: Interpolants [9792#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))), 9793#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= |main_#t~mem19| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))), 9784#true, 9785#false, 9786#(= 0 |main_#t~malloc0.offset|), 9787#(= main_~head~0.offset 0), 9788#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 9789#(and (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) |main_#t~mem13|) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 9790#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 9791#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0))]
[2018-02-02 10:33:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-02-02 10:33:46,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:33:46,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:33:46,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:33:46,249 INFO L87 Difference]: Start difference. First operand 204 states and 219 transitions. Second operand 10 states.
[2018-02-02 10:33:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:46,450 INFO L93 Difference]: Finished difference Result 222 states and 227 transitions.
[2018-02-02 10:33:46,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:33:46,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50
[2018-02-02 10:33:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:46,451 INFO L225 Difference]: With dead ends: 222
[2018-02-02 10:33:46,451 INFO L226 Difference]: Without dead ends: 196
[2018-02-02 10:33:46,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:33:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2018-02-02 10:33:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 175.
[2018-02-02 10:33:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states.
[2018-02-02 10:33:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions.
[2018-02-02 10:33:46,454 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 50
[2018-02-02 10:33:46,454 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:46,454 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions.
[2018-02-02 10:33:46,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:33:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions.
[2018-02-02 10:33:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 10:33:46,455 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:46,455 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:46,455 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -769925932, now seen corresponding path program 1 times
[2018-02-02 10:33:46,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:46,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:46,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:46,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:33:46,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:46,720 INFO L182 omatonBuilderFactory]: Interpolants [10208#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 10209#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 10210#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10211#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 10212#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 10213#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 10214#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| |main_#t~malloc9.base|))), 10215#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 10216#(and (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 10217#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 10218#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 10219#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 10220#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem14|))), 10221#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 10222#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 10223#(= 1 (select |#valid| |main_#t~mem17.base|)), 10224#(= 1 (select |#valid| main_~x~0.base)), 10205#true, 10206#false, 10207#(= 1 (select |#valid| main_~head~0.base))]
[2018-02-02 10:33:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:46,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:33:46,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:33:46,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:33:46,720 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 20 states.
[2018-02-02 10:33:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:47,461 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions.
[2018-02-02 10:33:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 10:33:47,461 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53
[2018-02-02 10:33:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:47,463 INFO L225 Difference]: With dead ends: 246
[2018-02-02 10:33:47,463 INFO L226 Difference]: Without dead ends: 246
[2018-02-02 10:33:47,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406
[2018-02-02 10:33:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states.
[2018-02-02 10:33:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 178.
[2018-02-02 10:33:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2018-02-02 10:33:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions.
[2018-02-02 10:33:47,468 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 53
[2018-02-02 10:33:47,468 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:47,468 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions.
[2018-02-02 10:33:47,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:33:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions.
[2018-02-02 10:33:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 10:33:47,468 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:47,469 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:47,469 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash -769925931, now seen corresponding path program 1 times
[2018-02-02 10:33:47,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:47,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:47,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:47,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:33:47,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:47,827 INFO L182 omatonBuilderFactory]: Interpolants [10688#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 10689#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 10690#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10691#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 10692#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 10693#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 10694#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| |main_#t~malloc9.base|))), 10695#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 10696#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 10697#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 10698#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 10699#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 10700#(or (not (= 0 |main_#t~mem14|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 10701#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)))), 10702#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10703#(and (= 8 (select |#length| |main_#t~mem17.base|)) (= 0 |main_#t~mem17.offset|)), 10704#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 10685#true, 10686#false, 10687#(= 1 (select |#valid| main_~head~0.base))]
[2018-02-02 10:33:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:47,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:33:47,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:33:47,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:33:47,828 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 20 states.
[2018-02-02 10:33:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:48,596 INFO L93 Difference]: Finished difference Result 276 states and 289 transitions.
[2018-02-02 10:33:48,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:33:48,596 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53
[2018-02-02 10:33:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:48,597 INFO L225 Difference]: With dead ends: 276
[2018-02-02 10:33:48,597 INFO L226 Difference]: Without dead ends: 276
[2018-02-02 10:33:48,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:33:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states.
[2018-02-02 10:33:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 178.
[2018-02-02 10:33:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2018-02-02 10:33:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions.
[2018-02-02 10:33:48,600 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 53
[2018-02-02 10:33:48,600 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:48,600 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions.
[2018-02-02 10:33:48,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:33:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions.
[2018-02-02 10:33:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 10:33:48,600 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:48,600 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:48,601 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1107343511, now seen corresponding path program 2 times
[2018-02-02 10:33:48,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:48,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:48,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:48,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:33:48,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:48,803 INFO L182 omatonBuilderFactory]: Interpolants [11200#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| |main_#t~malloc9.base|))), 11201#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 11202#(and (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 11203#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11204#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 11205#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 11206#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem14|))), 11207#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 11208#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11209#(= 1 (select |#valid| |main_#t~mem15.base|)), 11210#(= 1 (select |#valid| main_~x~0.base)), 11191#true, 11192#false, 11193#(= 1 (select |#valid| main_~head~0.base)), 11194#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 11195#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 11196#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11197#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11198#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 11199#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)))]
[2018-02-02 10:33:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:48,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:33:48,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:33:48,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:33:48,803 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 20 states.
[2018-02-02 10:33:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:49,410 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions.
[2018-02-02 10:33:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:33:49,411 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53
[2018-02-02 10:33:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:49,411 INFO L225 Difference]: With dead ends: 248
[2018-02-02 10:33:49,411 INFO L226 Difference]: Without dead ends: 248
[2018-02-02 10:33:49,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:33:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2018-02-02 10:33:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 186.
[2018-02-02 10:33:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states.
[2018-02-02 10:33:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions.
[2018-02-02 10:33:49,414 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 53
[2018-02-02 10:33:49,414 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:49,414 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions.
[2018-02-02 10:33:49,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:33:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions.
[2018-02-02 10:33:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 10:33:49,414 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:49,414 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:49,414 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1107343512, now seen corresponding path program 2 times
[2018-02-02 10:33:49,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:49,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:49,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:49,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:33:49,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:49,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-02 10:33:49,710 INFO L182 omatonBuilderFactory]: Interpolants [11680#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 11681#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 11682#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11683#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11684#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 11685#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 11686#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| |main_#t~malloc9.base|))), 11687#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11688#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 11689#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 11690#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 11691#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 11692#(or (not (= 0 |main_#t~mem14|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 11693#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)))), 11694#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11695#(and (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 11696#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 11677#true, 11678#false, 11679#(= 1 (select |#valid| main_~head~0.base))]
[2018-02-02 10:33:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:49,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:33:49,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:33:49,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:33:49,711 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand 20 states.
[2018-02-02 10:33:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:50,608 INFO L93 Difference]: Finished difference Result 288 states and 302 transitions.
[2018-02-02 10:33:50,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:33:50,609 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53
[2018-02-02 10:33:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:50,609 INFO L225 Difference]: With dead ends: 288
[2018-02-02 10:33:50,609 INFO L226 Difference]: Without dead ends: 288
[2018-02-02 10:33:50,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:33:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states.
[2018-02-02 10:33:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 192.
[2018-02-02 10:33:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states.
[2018-02-02 10:33:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions.
[2018-02-02 10:33:50,612 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 53
[2018-02-02 10:33:50,612 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:50,612 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions.
[2018-02-02 10:33:50,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:33:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions.
[2018-02-02 10:33:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 10:33:50,613 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:50,613 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:50,613 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash -684830248, now seen corresponding path program 2 times
[2018-02-02 10:33:50,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:50,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:50,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:50,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:33:50,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:50,825 INFO L182 omatonBuilderFactory]: Interpolants [12224#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 12225#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12226#(= 1 (select |#valid| |main_#t~mem17.base|)), 12227#(= 1 (select |#valid| main_~x~0.base)), 12209#true, 12210#false, 12211#(= (select |#valid| main_~head~0.base) 1), 12212#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 12213#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 12214#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 12215#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 12216#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 12217#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 12218#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 12219#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 12220#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 12221#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)))), 12222#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 12223#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)))]
[2018-02-02 10:33:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:50,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:33:50,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:33:50,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:33:50,825 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand 19 states.
[2018-02-02 10:33:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:51,455 INFO L93 Difference]: Finished difference Result 297 states and 314 transitions.
[2018-02-02 10:33:51,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:33:51,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55
[2018-02-02 10:33:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:51,456 INFO L225 Difference]: With dead ends: 297
[2018-02-02 10:33:51,456 INFO L226 Difference]: Without dead ends: 297
[2018-02-02 10:33:51,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=355, Invalid=1367, Unknown=0, NotChecked=0, Total=1722
[2018-02-02 10:33:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states.
[2018-02-02 10:33:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 223.
[2018-02-02 10:33:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states.
[2018-02-02 10:33:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 240 transitions.
[2018-02-02 10:33:51,460 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 240 transitions. Word has length 55
[2018-02-02 10:33:51,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:51,460 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 240 transitions.
[2018-02-02 10:33:51,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:33:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 240 transitions.
[2018-02-02 10:33:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 10:33:51,461 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:51,461 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:51,461 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash -684830247, now seen corresponding path program 2 times
[2018-02-02 10:33:51,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:51,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:51,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:51,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:33:51,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:51,874 INFO L182 omatonBuilderFactory]: Interpolants [12800#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 12801#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12802#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 12803#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 12804#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 12805#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12806#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12807#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 12808#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12809#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12810#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12811#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 12812#(and (= 8 (select |#length| |main_#t~mem17.base|)) (= 0 |main_#t~mem17.offset|)), 12813#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 12794#true, 12795#false, 12796#(= (select |#valid| main_~head~0.base) 1), 12797#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 12798#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 12799#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))]
[2018-02-02 10:33:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:51,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:33:51,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:33:51,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:33:51,875 INFO L87 Difference]: Start difference. First operand 223 states and 240 transitions. Second operand 20 states.
[2018-02-02 10:33:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:52,672 INFO L93 Difference]: Finished difference Result 324 states and 340 transitions.
[2018-02-02 10:33:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-02 10:33:52,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55
[2018-02-02 10:33:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:52,673 INFO L225 Difference]: With dead ends: 324
[2018-02-02 10:33:52,673 INFO L226 Difference]: Without dead ends: 324
[2018-02-02 10:33:52,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640
[2018-02-02 10:33:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2018-02-02 10:33:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 215.
[2018-02-02 10:33:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states.
[2018-02-02 10:33:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 231 transitions.
[2018-02-02 10:33:52,676 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 231 transitions. Word has length 55
[2018-02-02 10:33:52,676 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:52,677 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 231 transitions.
[2018-02-02 10:33:52,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:33:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 231 transitions.
[2018-02-02 10:33:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 10:33:52,677 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:52,677 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:52,678 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1192439195, now seen corresponding path program 3 times
[2018-02-02 10:33:52,678 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:52,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:52,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:52,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-02 10:33:52,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:52,944 INFO L182 omatonBuilderFactory]: Interpolants [13408#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 13409#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 13410#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 13411#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13412#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 13413#(or (not (= 0 |main_#t~mem14|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 13414#(= 1 (select |#valid| |main_#t~mem15.base|)), 13415#(= 1 (select |#valid| main_~x~0.base)), 13395#true, 13396#false, 13397#(= 1 (select |#valid| main_~head~0.base)), 13398#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 13399#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 13400#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 13401#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 13402#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 13403#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 13404#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 13405#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 13406#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 13407#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))))]
[2018-02-02 10:33:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:52,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 10:33:52,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 10:33:52,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:33:52,945 INFO L87 Difference]: Start difference. First operand 215 states and 231 transitions. Second operand 21 states.
[2018-02-02 10:33:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:53,722 INFO L93 Difference]: Finished difference Result 297 states and 314 transitions.
[2018-02-02 10:33:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-02-02 10:33:53,722 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55
[2018-02-02 10:33:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:53,723 INFO L225 Difference]: With dead ends: 297
[2018-02-02 10:33:53,723 INFO L226 Difference]: Without dead ends: 297
[2018-02-02 10:33:53,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1756, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 10:33:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states.
[2018-02-02 10:33:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 223.
[2018-02-02 10:33:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states.
[2018-02-02 10:33:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 240 transitions.
[2018-02-02 10:33:53,727 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 240 transitions. Word has length 55
[2018-02-02 10:33:53,728 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:53,728 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 240 transitions.
[2018-02-02 10:33:53,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 10:33:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 240 transitions.
[2018-02-02 10:33:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 10:33:53,728 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:53,729 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:53,729 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1192439196, now seen corresponding path program 3 times
[2018-02-02 10:33:53,729 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:53,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:54,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:54,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:33:54,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:54,099 INFO L182 omatonBuilderFactory]: Interpolants [13988#true, 13989#false, 13990#(= 1 (select |#valid| main_~head~0.base)), 13991#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 13992#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 13993#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 13994#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 13995#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13996#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13997#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 13998#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 13999#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14000#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14001#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 14002#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14003#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14004#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14005#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14006#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 14007#(or (not (= 0 |main_#t~mem14|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 14008#(and (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 14009#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))]
[2018-02-02 10:33:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:54,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 10:33:54,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 10:33:54,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:33:54,100 INFO L87 Difference]: Start difference. First operand 223 states and 240 transitions. Second operand 22 states.
[2018-02-02 10:33:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:55,091 INFO L93 Difference]: Finished difference Result 337 states and 354 transitions.
[2018-02-02 10:33:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:33:55,091 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55
[2018-02-02 10:33:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:55,092 INFO L225 Difference]: With dead ends: 337
[2018-02-02 10:33:55,092 INFO L226 Difference]: Without dead ends: 337
[2018-02-02 10:33:55,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=352, Invalid=1718, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 10:33:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states.
[2018-02-02 10:33:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 215.
[2018-02-02 10:33:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states.
[2018-02-02 10:33:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 231 transitions.
[2018-02-02 10:33:55,095 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 231 transitions. Word has length 55
[2018-02-02 10:33:55,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:55,095 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 231 transitions.
[2018-02-02 10:33:55,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 10:33:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 231 transitions.
[2018-02-02 10:33:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 10:33:55,095 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:55,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:55,095 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash 232854310, now seen corresponding path program 1 times
[2018-02-02 10:33:55,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:55,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:55,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:55,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:33:55,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:55,236 INFO L182 omatonBuilderFactory]: Interpolants [14624#(= 0 |main_#t~mem22.offset|), 14610#true, 14611#false, 14612#(= (select |#valid| main_~head~0.base) 1), 14613#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 14614#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 14615#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 14616#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14617#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14618#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 14619#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14620#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14621#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 14622#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 14623#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))]
[2018-02-02 10:33:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:55,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:33:55,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:33:55,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:33:55,236 INFO L87 Difference]: Start difference. First operand 215 states and 231 transitions. Second operand 15 states.
[2018-02-02 10:33:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:55,594 INFO L93 Difference]: Finished difference Result 331 states and 347 transitions.
[2018-02-02 10:33:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:33:55,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56
[2018-02-02 10:33:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:55,595 INFO L225 Difference]: With dead ends: 331
[2018-02-02 10:33:55,595 INFO L226 Difference]: Without dead ends: 331
[2018-02-02 10:33:55,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:33:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2018-02-02 10:33:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 283.
[2018-02-02 10:33:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states.
[2018-02-02 10:33:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 311 transitions.
[2018-02-02 10:33:55,598 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 311 transitions. Word has length 56
[2018-02-02 10:33:55,598 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:55,598 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 311 transitions.
[2018-02-02 10:33:55,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:33:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 311 transitions.
[2018-02-02 10:33:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-02-02 10:33:55,599 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:55,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:55,599 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 434698568, now seen corresponding path program 1 times
[2018-02-02 10:33:55,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:55,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:55,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:55,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:33:55,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:55,761 INFO L182 omatonBuilderFactory]: Interpolants [15265#true, 15266#false, 15267#(= (select |#valid| main_~head~0.base) 1), 15268#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15269#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 15270#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15271#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15272#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15273#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc9.base|))), 15274#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15275#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15276#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 15277#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 15278#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 15279#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15280#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15281#(= 1 (select (store |#valid| |main_#t~mem22.base| 0) main_~x~0.base)), 15282#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:33:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:55,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:33:55,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:33:55,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:33:55,761 INFO L87 Difference]: Start difference. First operand 283 states and 311 transitions. Second operand 18 states.
[2018-02-02 10:33:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:56,288 INFO L93 Difference]: Finished difference Result 330 states and 346 transitions.
[2018-02-02 10:33:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-02-02 10:33:56,288 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58
[2018-02-02 10:33:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:56,289 INFO L225 Difference]: With dead ends: 330
[2018-02-02 10:33:56,289 INFO L226 Difference]: Without dead ends: 330
[2018-02-02 10:33:56,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 10:33:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states.
[2018-02-02 10:33:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 285.
[2018-02-02 10:33:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states.
[2018-02-02 10:33:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 313 transitions.
[2018-02-02 10:33:56,293 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 313 transitions. Word has length 58
[2018-02-02 10:33:56,293 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:56,293 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 313 transitions.
[2018-02-02 10:33:56,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:33:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 313 transitions.
[2018-02-02 10:33:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-02-02 10:33:56,294 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:56,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:56,294 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:56,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1133501352, now seen corresponding path program 1 times
[2018-02-02 10:33:56,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:56,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:56,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:56,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:33:56,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:56,628 INFO L182 omatonBuilderFactory]: Interpolants [15936#true, 15937#false, 15938#(= 0 |main_#t~malloc0.offset|), 15939#(= main_~head~0.offset 0), 15940#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 15941#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 15942#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))) (not (= (+ main_~head~0.offset 4) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 15943#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))) (not (= (+ main_~head~0.offset 4) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 15944#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~head~0.offset 4) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 15945#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 15946#(and (= 0 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 15947#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 15948#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 15949#(and (= 0 (select (select (store |#memory_int| |main_#t~mem11.base| (store (select |#memory_int| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) 2)) main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 15950#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 15951#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 15952#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 |main_#t~mem13|)), 15953#(not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 1)), 15954#(not (= |main_#t~mem19| 1))]
[2018-02-02 10:33:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:56,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:33:56,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:33:56,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:33:56,629 INFO L87 Difference]: Start difference. First operand 285 states and 313 transitions. Second operand 19 states.
[2018-02-02 10:33:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:57,161 INFO L93 Difference]: Finished difference Result 294 states and 309 transitions.
[2018-02-02 10:33:57,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:33:57,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60
[2018-02-02 10:33:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:57,162 INFO L225 Difference]: With dead ends: 294
[2018-02-02 10:33:57,162 INFO L226 Difference]: Without dead ends: 294
[2018-02-02 10:33:57,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 10:33:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2018-02-02 10:33:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 257.
[2018-02-02 10:33:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states.
[2018-02-02 10:33:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions.
[2018-02-02 10:33:57,165 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 60
[2018-02-02 10:33:57,165 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:57,165 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions.
[2018-02-02 10:33:57,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:33:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions.
[2018-02-02 10:33:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-02-02 10:33:57,166 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:57,166 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:57,166 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash 314842481, now seen corresponding path program 2 times
[2018-02-02 10:33:57,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:57,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:57,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:57,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:33:57,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:57,565 INFO L182 omatonBuilderFactory]: Interpolants [16544#(= 0 |main_#t~malloc0.offset|), 16545#(= main_~head~0.offset 0), 16546#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 16547#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 16548#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 16549#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 16550#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 16551#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 16552#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 16553#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 16554#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 16555#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= main_~head~0.offset |main_#t~mem11.offset|) (= main_~head~0.offset 0)), 16556#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (+ main_~head~0.offset 4)) 2) (= main_~head~0.offset 0)), 16557#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 4)) 2)), 16558#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 4)) 2))), 16559#(or (not (= 0 |main_#t~mem14|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 4)) 2))), 16560#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 16561#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 16562#(and (= (select (select |#memory_int| |main_#t~mem15.base|) (+ 0 4)) 2) (= 0 |main_#t~mem15.offset|)), 16563#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 2), 16564#(and (= |main_#t~mem13| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 2)), 16542#true, 16543#false]
[2018-02-02 10:33:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:57,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 10:33:57,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 10:33:57,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:33:57,565 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand 23 states.
[2018-02-02 10:33:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:58,612 INFO L93 Difference]: Finished difference Result 306 states and 320 transitions.
[2018-02-02 10:33:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:33:58,613 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62
[2018-02-02 10:33:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:58,613 INFO L225 Difference]: With dead ends: 306
[2018-02-02 10:33:58,613 INFO L226 Difference]: Without dead ends: 306
[2018-02-02 10:33:58,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=395, Invalid=1957, Unknown=0, NotChecked=0, Total=2352
[2018-02-02 10:33:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states.
[2018-02-02 10:33:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 261.
[2018-02-02 10:33:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states.
[2018-02-02 10:33:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 289 transitions.
[2018-02-02 10:33:58,616 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 289 transitions. Word has length 62
[2018-02-02 10:33:58,616 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:58,616 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 289 transitions.
[2018-02-02 10:33:58,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 10:33:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 289 transitions.
[2018-02-02 10:33:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-02-02 10:33:58,617 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:58,617 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2018-02-02 10:33:58,617 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:58,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2102855372, now seen corresponding path program 4 times
[2018-02-02 10:33:58,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:58,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:33:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:58,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:33:58,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:33:58,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:33:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:58,963 INFO L182 omatonBuilderFactory]: Interpolants [17184#true, 17185#false, 17186#(= 0 |main_#t~malloc0.offset|), 17187#(= main_~head~0.offset 0), 17188#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 17189#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 17190#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 17191#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 17192#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 17193#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 17194#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 17195#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 17196#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 17197#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= main_~head~0.offset |main_#t~mem11.offset|) (= main_~head~0.offset 0)), 17198#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (+ main_~head~0.offset 4)) 2) (= main_~head~0.offset 0)), 17199#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 4)) 2)), 17200#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 4)) 2))), 17201#(or (not (= 0 |main_#t~mem14|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 4)) 2))), 17202#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 17203#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 17204#(and (= (select (select |#memory_int| |main_#t~mem15.base|) (+ 0 4)) 2) (= 0 |main_#t~mem15.offset|)), 17205#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 2), 17206#(= |main_#t~mem14| 2)]
[2018-02-02 10:33:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:33:58,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 10:33:58,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 10:33:58,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:33:58,964 INFO L87 Difference]: Start difference. First operand 261 states and 289 transitions. Second operand 23 states.
[2018-02-02 10:33:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:33:59,832 INFO L93 Difference]: Finished difference Result 266 states and 278 transitions.
[2018-02-02 10:33:59,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-02 10:33:59,832 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62
[2018-02-02 10:33:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:33:59,833 INFO L225 Difference]: With dead ends: 266
[2018-02-02 10:33:59,833 INFO L226 Difference]: Without dead ends: 254
[2018-02-02 10:33:59,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=1726, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 10:33:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states.
[2018-02-02 10:33:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 221.
[2018-02-02 10:33:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states.
[2018-02-02 10:33:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 235 transitions.
[2018-02-02 10:33:59,835 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 235 transitions. Word has length 62
[2018-02-02 10:33:59,835 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:33:59,835 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 235 transitions.
[2018-02-02 10:33:59,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 10:33:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 235 transitions.
[2018-02-02 10:33:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:33:59,836 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:33:59,836 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:33:59,836 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:33:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash -468498279, now seen corresponding path program 1 times
[2018-02-02 10:33:59,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:33:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:33:59,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:00,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:00,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25
[2018-02-02 10:34:00,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:00,171 INFO L182 omatonBuilderFactory]: Interpolants [17740#true, 17741#false, 17742#(not (= 0 |main_#t~malloc0.base|)), 17743#(not (= 0 main_~head~0.base)), 17744#(and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base))), 17745#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 17746#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 17747#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17748#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 17749#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 17750#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc9.base|)) (not (= 0 main_~head~0.base))), 17751#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 17752#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 17753#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 17754#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base)), 17755#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base))), 17756#(or (not (= 0 |main_#t~mem14|)) (and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base))), 17757#(and (not (= main_~head~0.base |main_#t~mem15.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem15.base|) (not (= 0 main_~head~0.base))), 17758#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~head~0.base))), 17759#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~head~0.base))), 17760#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 17761#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base))), 17762#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~head~0.base))), 17763#(and (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem20.base|)) (not (= 0 main_~head~0.base))), 17764#(and (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= 0 main_~head~0.base))), 17765#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:34:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:00,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-02-02 10:34:00,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-02-02 10:34:00,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:34:00,172 INFO L87 Difference]: Start difference. First operand 221 states and 235 transitions. Second operand 26 states.
[2018-02-02 10:34:01,247 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 54 DAG size of output 29
[2018-02-02 10:34:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:01,640 INFO L93 Difference]: Finished difference Result 275 states and 287 transitions.
[2018-02-02 10:34:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-02-02 10:34:01,640 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64
[2018-02-02 10:34:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:01,641 INFO L225 Difference]: With dead ends: 275
[2018-02-02 10:34:01,641 INFO L226 Difference]: Without dead ends: 275
[2018-02-02 10:34:01,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=591, Invalid=2379, Unknown=0, NotChecked=0, Total=2970
[2018-02-02 10:34:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2018-02-02 10:34:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 226.
[2018-02-02 10:34:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-02-02 10:34:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 241 transitions.
[2018-02-02 10:34:01,644 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 241 transitions. Word has length 64
[2018-02-02 10:34:01,645 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:01,645 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 241 transitions.
[2018-02-02 10:34:01,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-02-02 10:34:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 241 transitions.
[2018-02-02 10:34:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:34:01,645 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:01,646 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:01,646 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash -468498278, now seen corresponding path program 1 times
[2018-02-02 10:34:01,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:01,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:02,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:02,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:34:02,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:02,096 INFO L182 omatonBuilderFactory]: Interpolants [18336#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 18337#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 18338#(and (= main_~x~0.offset main_~head~0.offset) (or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 18339#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (or (not (= 0 |main_#t~mem14|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)))), 18340#(and (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18341#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18342#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18343#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18344#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 18345#(and (= 0 |main_#t~mem20.offset|) (<= 8 (select |#length| |main_#t~mem20.base|))), 18346#(and (= main_~x~0.offset 0) (<= 8 (select |#length| main_~x~0.base))), 18325#true, 18326#false, 18327#(= 1 (select |#valid| main_~head~0.base)), 18328#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 18329#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 18330#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 18331#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18332#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18333#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 18334#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18335#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))]
[2018-02-02 10:34:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:02,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 10:34:02,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 10:34:02,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:34:02,097 INFO L87 Difference]: Start difference. First operand 226 states and 241 transitions. Second operand 22 states.
[2018-02-02 10:34:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:02,644 INFO L93 Difference]: Finished difference Result 251 states and 263 transitions.
[2018-02-02 10:34:02,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-02 10:34:02,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64
[2018-02-02 10:34:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:02,645 INFO L225 Difference]: With dead ends: 251
[2018-02-02 10:34:02,645 INFO L226 Difference]: Without dead ends: 251
[2018-02-02 10:34:02,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 10:34:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states.
[2018-02-02 10:34:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 228.
[2018-02-02 10:34:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states.
[2018-02-02 10:34:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions.
[2018-02-02 10:34:02,648 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 64
[2018-02-02 10:34:02,648 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:02,648 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions.
[2018-02-02 10:34:02,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 10:34:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions.
[2018-02-02 10:34:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:34:02,649 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:02,649 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:02,649 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash 63638765, now seen corresponding path program 3 times
[2018-02-02 10:34:02,650 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:02,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:03,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:03,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:34:03,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:03,016 INFO L182 omatonBuilderFactory]: Interpolants [18880#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 18881#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem14|))), 18882#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 18883#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 18884#(= 1 (select |#valid| |main_#t~mem17.base|)), 18885#(= 1 (select |#valid| main_~x~0.base)), 18862#true, 18863#false, 18864#(= 1 (select |#valid| main_~head~0.base)), 18865#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 18866#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 18867#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 18868#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 18869#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 18870#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 18871#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 18872#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 18873#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 18874#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 18875#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)))), 18876#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 18877#(and (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 18878#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 18879#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))]
[2018-02-02 10:34:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:03,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 10:34:03,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 10:34:03,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:34:03,017 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand 24 states.
[2018-02-02 10:34:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:04,144 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions.
[2018-02-02 10:34:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-02-02 10:34:04,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64
[2018-02-02 10:34:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:04,145 INFO L225 Difference]: With dead ends: 306
[2018-02-02 10:34:04,145 INFO L226 Difference]: Without dead ends: 306
[2018-02-02 10:34:04,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256
[2018-02-02 10:34:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states.
[2018-02-02 10:34:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 231.
[2018-02-02 10:34:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states.
[2018-02-02 10:34:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 247 transitions.
[2018-02-02 10:34:04,148 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 247 transitions. Word has length 64
[2018-02-02 10:34:04,148 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:04,148 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 247 transitions.
[2018-02-02 10:34:04,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 10:34:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 247 transitions.
[2018-02-02 10:34:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:34:04,148 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:04,148 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:04,148 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash 63638766, now seen corresponding path program 2 times
[2018-02-02 10:34:04,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:04,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:04,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:04,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2018-02-02 10:34:04,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:04,560 INFO L182 omatonBuilderFactory]: Interpolants [19471#true, 19472#false, 19473#(= 1 (select |#valid| main_~head~0.base)), 19474#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 19475#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 19476#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19477#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 19478#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 19479#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 19480#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 19481#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 19482#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| |main_#t~mem6.base|))), 19483#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19484#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19485#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)))), 19486#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19487#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 19488#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 19489#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 19490#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 19491#(or (not (= 0 |main_#t~mem14|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 19492#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)))), 19493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 19494#(and (= 8 (select |#length| |main_#t~mem17.base|)) (= 0 |main_#t~mem17.offset|)), 19495#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))]
[2018-02-02 10:34:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:04,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-02 10:34:04,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-02 10:34:04,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:34:04,561 INFO L87 Difference]: Start difference. First operand 231 states and 247 transitions. Second operand 25 states.
[2018-02-02 10:34:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:05,686 INFO L93 Difference]: Finished difference Result 336 states and 353 transitions.
[2018-02-02 10:34:05,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:34:05,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 64
[2018-02-02 10:34:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:05,687 INFO L225 Difference]: With dead ends: 336
[2018-02-02 10:34:05,687 INFO L226 Difference]: Without dead ends: 336
[2018-02-02 10:34:05,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1737, Unknown=0, NotChecked=0, Total=1980
[2018-02-02 10:34:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2018-02-02 10:34:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 231.
[2018-02-02 10:34:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states.
[2018-02-02 10:34:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 246 transitions.
[2018-02-02 10:34:05,690 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 246 transitions. Word has length 64
[2018-02-02 10:34:05,690 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:05,690 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 246 transitions.
[2018-02-02 10:34:05,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-02 10:34:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 246 transitions.
[2018-02-02 10:34:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:34:05,690 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:05,690 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:05,690 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:05,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1940908208, now seen corresponding path program 5 times
[2018-02-02 10:34:05,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:05,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:06,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:06,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:34:06,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:06,011 INFO L182 omatonBuilderFactory]: Interpolants [20103#true, 20104#false, 20105#(= 1 (select |#valid| main_~head~0.base)), 20106#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 20107#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 20108#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20109#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20110#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20111#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20112#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 20113#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 20114#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 20115#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 20116#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)))), 20117#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 20118#(and (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 20119#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 20120#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 20121#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 20122#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem14|))), 20123#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 20124#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 20125#(= 1 (select |#valid| |main_#t~mem15.base|)), 20126#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:34:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:06,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 10:34:06,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 10:34:06,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:34:06,012 INFO L87 Difference]: Start difference. First operand 231 states and 246 transitions. Second operand 24 states.
[2018-02-02 10:34:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:07,096 INFO L93 Difference]: Finished difference Result 308 states and 326 transitions.
[2018-02-02 10:34:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 10:34:07,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64
[2018-02-02 10:34:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:07,098 INFO L225 Difference]: With dead ends: 308
[2018-02-02 10:34:07,098 INFO L226 Difference]: Without dead ends: 308
[2018-02-02 10:34:07,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=299, Invalid=1771, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 10:34:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states.
[2018-02-02 10:34:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 239.
[2018-02-02 10:34:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states.
[2018-02-02 10:34:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 255 transitions.
[2018-02-02 10:34:07,100 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 255 transitions. Word has length 64
[2018-02-02 10:34:07,101 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:07,101 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 255 transitions.
[2018-02-02 10:34:07,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 10:34:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 255 transitions.
[2018-02-02 10:34:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:34:07,101 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:07,101 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:07,102 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1940908209, now seen corresponding path program 4 times
[2018-02-02 10:34:07,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:07,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:07,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:07,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2018-02-02 10:34:07,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:07,498 INFO L182 omatonBuilderFactory]: Interpolants [20736#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 20737#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 20738#(or (not (= 0 |main_#t~mem14|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 20739#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)))), 20740#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 20741#(and (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 20742#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 20718#true, 20719#false, 20720#(= 1 (select |#valid| main_~head~0.base)), 20721#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 20722#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 20723#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20724#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20725#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20726#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20727#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 20728#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 20729#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| |main_#t~mem6.base|))), 20730#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 20731#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 20732#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)))), 20733#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 20734#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 20735#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))]
[2018-02-02 10:34:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:07,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-02 10:34:07,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-02 10:34:07,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:34:07,499 INFO L87 Difference]: Start difference. First operand 239 states and 255 transitions. Second operand 25 states.
[2018-02-02 10:34:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:08,796 INFO L93 Difference]: Finished difference Result 348 states and 366 transitions.
[2018-02-02 10:34:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:34:08,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 64
[2018-02-02 10:34:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:08,797 INFO L225 Difference]: With dead ends: 348
[2018-02-02 10:34:08,797 INFO L226 Difference]: Without dead ends: 348
[2018-02-02 10:34:08,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=1737, Unknown=0, NotChecked=0, Total=1980
[2018-02-02 10:34:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states.
[2018-02-02 10:34:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 245.
[2018-02-02 10:34:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2018-02-02 10:34:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 261 transitions.
[2018-02-02 10:34:08,800 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 261 transitions. Word has length 64
[2018-02-02 10:34:08,800 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:08,800 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 261 transitions.
[2018-02-02 10:34:08,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-02 10:34:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 261 transitions.
[2018-02-02 10:34:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-02-02 10:34:08,800 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:08,800 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:08,800 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:08,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1506926513, now seen corresponding path program 3 times
[2018-02-02 10:34:08,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:08,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:09,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:09,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-02 10:34:09,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:09,072 INFO L182 omatonBuilderFactory]: Interpolants [21376#true, 21377#false, 21378#(= (select |#valid| main_~head~0.base) 1), 21379#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21380#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 21381#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21382#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 21383#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 21384#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 21385#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 21386#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 21387#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 21388#(and (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 21389#(and (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 21390#(and (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 21391#(and (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~x~0.base main_~head~0.base))), 21392#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))))), 21393#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 21394#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 21395#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 21396#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 21397#(= 1 (select |#valid| |main_#t~mem17.base|)), 21398#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:34:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:09,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 10:34:09,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 10:34:09,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:34:09,072 INFO L87 Difference]: Start difference. First operand 245 states and 261 transitions. Second operand 23 states.
[2018-02-02 10:34:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:09,899 INFO L93 Difference]: Finished difference Result 266 states and 279 transitions.
[2018-02-02 10:34:09,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 10:34:09,899 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66
[2018-02-02 10:34:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:09,900 INFO L225 Difference]: With dead ends: 266
[2018-02-02 10:34:09,900 INFO L226 Difference]: Without dead ends: 266
[2018-02-02 10:34:09,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=427, Invalid=1735, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 10:34:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2018-02-02 10:34:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 245.
[2018-02-02 10:34:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2018-02-02 10:34:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions.
[2018-02-02 10:34:09,903 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 66
[2018-02-02 10:34:09,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:09,903 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions.
[2018-02-02 10:34:09,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 10:34:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions.
[2018-02-02 10:34:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-02-02 10:34:09,904 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:09,904 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:09,904 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1506926514, now seen corresponding path program 3 times
[2018-02-02 10:34:09,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:09,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:34:10,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:10,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-02 10:34:10,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:10,354 INFO L182 omatonBuilderFactory]: Interpolants [21958#true, 21959#false, 21960#(= (select |#valid| main_~head~0.base) 1), 21961#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21962#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 21963#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21964#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 21965#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21966#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 21967#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 21968#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21969#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21970#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21971#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 21972#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21973#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21974#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 21975#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21976#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21977#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21978#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 21979#(and (= 8 (select |#length| |main_#t~mem17.base|)) (= 0 |main_#t~mem17.offset|)), 21980#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))]
[2018-02-02 10:34:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:34:10,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 10:34:10,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 10:34:10,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:34:10,354 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 23 states.
[2018-02-02 10:34:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:11,253 INFO L93 Difference]: Finished difference Result 287 states and 300 transitions.
[2018-02-02 10:34:11,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:34:11,253 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66
[2018-02-02 10:34:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:11,254 INFO L225 Difference]: With dead ends: 287
[2018-02-02 10:34:11,254 INFO L226 Difference]: Without dead ends: 287
[2018-02-02 10:34:11,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=418, Invalid=1744, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 10:34:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states.
[2018-02-02 10:34:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 237.
[2018-02-02 10:34:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states.
[2018-02-02 10:34:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 251 transitions.
[2018-02-02 10:34:11,256 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 251 transitions. Word has length 66
[2018-02-02 10:34:11,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:11,256 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 251 transitions.
[2018-02-02 10:34:11,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 10:34:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 251 transitions.
[2018-02-02 10:34:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-02-02 10:34:11,257 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:11,257 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:11,257 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:11,257 INFO L82 PathProgramCache]: Analyzing trace with hash -910771340, now seen corresponding path program 6 times
[2018-02-02 10:34:11,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:11,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:11,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:11,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2018-02-02 10:34:11,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:11,528 INFO L182 omatonBuilderFactory]: Interpolants [22553#true, 22554#false, 22555#(= 1 (select |#valid| main_~head~0.base)), 22556#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 22557#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 22558#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22559#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 22560#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 22561#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 22562#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 22563#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 22564#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 22565#(and (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 22566#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 22567#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 22568#(and (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 22569#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))))), 22570#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 22571#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 22572#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 22573#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 22574#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 22575#(or (not (= 0 |main_#t~mem14|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 22576#(= 1 (select |#valid| |main_#t~mem15.base|)), 22577#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:34:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:11,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-02 10:34:11,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-02 10:34:11,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:34:11,528 INFO L87 Difference]: Start difference. First operand 237 states and 251 transitions. Second operand 25 states.
[2018-02-02 10:34:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:12,454 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions.
[2018-02-02 10:34:12,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 10:34:12,455 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66
[2018-02-02 10:34:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:12,455 INFO L225 Difference]: With dead ends: 260
[2018-02-02 10:34:12,455 INFO L226 Difference]: Without dead ends: 260
[2018-02-02 10:34:12,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=492, Invalid=2160, Unknown=0, NotChecked=0, Total=2652
[2018-02-02 10:34:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states.
[2018-02-02 10:34:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 245.
[2018-02-02 10:34:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2018-02-02 10:34:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions.
[2018-02-02 10:34:12,458 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 66
[2018-02-02 10:34:12,458 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:12,458 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions.
[2018-02-02 10:34:12,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-02 10:34:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions.
[2018-02-02 10:34:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-02-02 10:34:12,458 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:12,458 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:12,458 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash -910771339, now seen corresponding path program 5 times
[2018-02-02 10:34:12,459 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:12,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:12,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:12,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26
[2018-02-02 10:34:12,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:12,944 INFO L182 omatonBuilderFactory]: Interpolants [23137#true, 23138#false, 23139#(= 1 (select |#valid| main_~head~0.base)), 23140#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 23141#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 23142#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23143#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 23144#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23145#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23146#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 23147#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 23148#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23149#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23150#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 23151#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23152#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23153#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23154#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23155#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 23156#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23157#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23158#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23159#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 23160#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 23161#(or (not (= 0 |main_#t~mem14|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 23162#(and (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 23163#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))]
[2018-02-02 10:34:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:12,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-02-02 10:34:12,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-02-02 10:34:12,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702
[2018-02-02 10:34:12,944 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 27 states.
[2018-02-02 10:34:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:14,124 INFO L93 Difference]: Finished difference Result 294 states and 308 transitions.
[2018-02-02 10:34:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-02-02 10:34:14,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66
[2018-02-02 10:34:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:14,125 INFO L225 Difference]: With dead ends: 294
[2018-02-02 10:34:14,125 INFO L226 Difference]: Without dead ends: 294
[2018-02-02 10:34:14,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=507, Invalid=2355, Unknown=0, NotChecked=0, Total=2862
[2018-02-02 10:34:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2018-02-02 10:34:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 237.
[2018-02-02 10:34:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states.
[2018-02-02 10:34:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 251 transitions.
[2018-02-02 10:34:14,128 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 251 transitions. Word has length 66
[2018-02-02 10:34:14,128 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:14,128 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 251 transitions.
[2018-02-02 10:34:14,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-02-02 10:34:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 251 transitions.
[2018-02-02 10:34:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-02-02 10:34:14,129 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:14,129 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:14,129 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash -542162835, now seen corresponding path program 2 times
[2018-02-02 10:34:14,129 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:14,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-02-02 10:34:14,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:14,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:34:14,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:14,275 INFO L182 omatonBuilderFactory]: Interpolants [23749#true, 23750#false, 23751#(= (select |#valid| main_~head~0.base) 1), 23752#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23753#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 23754#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23755#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23756#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23757#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 23758#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23759#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 23760#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23761#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23762#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 23763#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 23764#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 23765#(= 0 |main_#t~mem22.offset|)]
[2018-02-02 10:34:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-02-02 10:34:14,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:34:14,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:34:14,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:34:14,275 INFO L87 Difference]: Start difference. First operand 237 states and 251 transitions. Second operand 17 states.
[2018-02-02 10:34:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:14,705 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions.
[2018-02-02 10:34:14,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:34:14,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67
[2018-02-02 10:34:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:14,706 INFO L225 Difference]: With dead ends: 278
[2018-02-02 10:34:14,706 INFO L226 Difference]: Without dead ends: 278
[2018-02-02 10:34:14,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:34:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states.
[2018-02-02 10:34:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 243.
[2018-02-02 10:34:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states.
[2018-02-02 10:34:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 257 transitions.
[2018-02-02 10:34:14,708 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 257 transitions. Word has length 67
[2018-02-02 10:34:14,708 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:14,708 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 257 transitions.
[2018-02-02 10:34:14,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:34:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 257 transitions.
[2018-02-02 10:34:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-02-02 10:34:14,709 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:14,709 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:14,709 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1578975653, now seen corresponding path program 1 times
[2018-02-02 10:34:14,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:14,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:14,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:14,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:34:14,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:14,896 INFO L182 omatonBuilderFactory]: Interpolants [24320#false, 24321#(= 1 (select |#valid| main_~head~0.base)), 24322#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 24323#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 24324#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 24325#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24326#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24327#(and (not (= main_~head~0.base |main_#t~malloc9.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 24328#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24329#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24330#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 24331#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 24332#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))), 24333#(or (not (= 0 |main_#t~mem14|)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))), 24334#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 24335#(= 0 |main_#t~mem20.offset|), 24336#(= 0 main_~x~0.offset), 24337#(= main_~head~0.offset 0), 24319#true]
[2018-02-02 10:34:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:14,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:34:14,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:34:14,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:34:14,897 INFO L87 Difference]: Start difference. First operand 243 states and 257 transitions. Second operand 19 states.
[2018-02-02 10:34:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:15,525 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions.
[2018-02-02 10:34:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:34:15,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68
[2018-02-02 10:34:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:15,526 INFO L225 Difference]: With dead ends: 264
[2018-02-02 10:34:15,526 INFO L226 Difference]: Without dead ends: 264
[2018-02-02 10:34:15,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 10:34:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states.
[2018-02-02 10:34:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 242.
[2018-02-02 10:34:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states.
[2018-02-02 10:34:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions.
[2018-02-02 10:34:15,528 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 256 transitions. Word has length 68
[2018-02-02 10:34:15,528 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:15,528 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 256 transitions.
[2018-02-02 10:34:15,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:34:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 256 transitions.
[2018-02-02 10:34:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-02-02 10:34:15,529 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:15,529 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:15,529 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:15,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1327435569, now seen corresponding path program 2 times
[2018-02-02 10:34:15,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:15,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-02-02 10:34:15,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:15,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:34:15,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:15,711 INFO L182 omatonBuilderFactory]: Interpolants [24874#true, 24875#false, 24876#(= 1 (select |#valid| main_~head~0.base)), 24877#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 24878#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 24879#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 24880#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 24881#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 24882#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 24883#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 24884#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc9.base|))), 24885#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 24886#(and (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 24887#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 24888#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 24889#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 24890#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 24891#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 24892#(= 1 (select (store |#valid| |main_#t~mem22.base| 0) main_~x~0.base)), 24893#(= 1 (select |#valid| main_~x~0.base))]
[2018-02-02 10:34:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-02-02 10:34:15,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:34:15,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:34:15,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:34:15,711 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand 20 states.
[2018-02-02 10:34:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:16,274 INFO L93 Difference]: Finished difference Result 279 states and 291 transitions.
[2018-02-02 10:34:16,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-02 10:34:16,274 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69
[2018-02-02 10:34:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:16,275 INFO L225 Difference]: With dead ends: 279
[2018-02-02 10:34:16,275 INFO L226 Difference]: Without dead ends: 279
[2018-02-02 10:34:16,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 10:34:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2018-02-02 10:34:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244.
[2018-02-02 10:34:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states.
[2018-02-02 10:34:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 258 transitions.
[2018-02-02 10:34:16,277 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 258 transitions. Word has length 69
[2018-02-02 10:34:16,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:16,277 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 258 transitions.
[2018-02-02 10:34:16,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:34:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 258 transitions.
[2018-02-02 10:34:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-02-02 10:34:16,277 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:16,277 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:16,278 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1272142467, now seen corresponding path program 2 times
[2018-02-02 10:34:16,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:16,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:16,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:16,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28
[2018-02-02 10:34:16,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:16,802 INFO L182 omatonBuilderFactory]: Interpolants [25472#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 25473#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base))), 25474#(or (not (= 0 |main_#t~mem14|)) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base))), 25475#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 main_~head~0.base)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25476#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= 0 main_~head~0.base))), 25477#(and (not (= 0 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))), 25478#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= 0 main_~head~0.base))), 25479#(and (not (= |main_#t~mem20.base| 0)) (not (= 0 main_~head~0.base)) (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))) (not (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0)))), 25480#(and (not (= main_~x~0.base 0)) (or (not (= main_~x~0.offset 0)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (not (= 0 main_~head~0.base))), 25481#(and (or (not (= main_~x~0.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (not (= main_~x~0.base 0))), 25482#(and (not (= main_~head~0.base 0)) (or (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.offset 0)))), 25483#(and (not (= main_~head~0.base 0)) (or (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem20.base|)) (not (= main_~head~0.offset 0)))), 25484#(and (not (= main_~head~0.base 0)) (or (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= main_~head~0.offset 0)))), 25485#(= 1 (select |#valid| main_~x~0.base)), 25457#true, 25458#false, 25459#(not (= 0 |main_#t~malloc0.base|)), 25460#(not (= 0 main_~head~0.base)), 25461#(and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base))), 25462#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 25463#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= |main_#t~malloc4.offset| 0) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 25464#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 25465#(and (= |main_#t~mem6.offset| 0) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= 0 main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 25466#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 25467#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 25468#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset) 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base))), 25469#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 25470#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 25471#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))]
[2018-02-02 10:34:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:16,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-02-02 10:34:16,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-02-02 10:34:16,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:34:16,803 INFO L87 Difference]: Start difference. First operand 244 states and 258 transitions. Second operand 29 states.
[2018-02-02 10:34:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:18,279 INFO L93 Difference]: Finished difference Result 292 states and 304 transitions.
[2018-02-02 10:34:18,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-02-02 10:34:18,280 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70
[2018-02-02 10:34:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:18,280 INFO L225 Difference]: With dead ends: 292
[2018-02-02 10:34:18,280 INFO L226 Difference]: Without dead ends: 292
[2018-02-02 10:34:18,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=598, Invalid=2942, Unknown=0, NotChecked=0, Total=3540
[2018-02-02 10:34:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states.
[2018-02-02 10:34:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 249.
[2018-02-02 10:34:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states.
[2018-02-02 10:34:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 264 transitions.
[2018-02-02 10:34:18,283 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 264 transitions. Word has length 70
[2018-02-02 10:34:18,283 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:18,283 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 264 transitions.
[2018-02-02 10:34:18,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-02-02 10:34:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 264 transitions.
[2018-02-02 10:34:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-02-02 10:34:18,283 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:18,283 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:18,283 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1272142466, now seen corresponding path program 2 times
[2018-02-02 10:34:18,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:18,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:18,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:18,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27
[2018-02-02 10:34:18,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:18,783 INFO L182 omatonBuilderFactory]: Interpolants [26112#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~x~0.offset 0)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 26113#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.offset 0)))), 26114#(and (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|)) (or (<= 0 |main_#t~mem20.offset|) (not (= main_~head~0.offset 0)))), 26115#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (or (<= 0 main_~x~0.offset) (not (= main_~head~0.offset 0)))), 26116#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 26089#true, 26090#false, 26091#(= 1 (select |#valid| main_~head~0.base)), 26092#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26093#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base)), 26094#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26095#(and (= |main_#t~mem6.offset| 0) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 26096#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base))), 26097#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base))), 26098#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 26099#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 26100#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 26101#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 26102#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= main_~x~0.base main_~head~0.base)), 26103#(and (or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26104#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (or (not (= 0 |main_#t~mem14|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))), 26105#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) 0)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 26106#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 26107#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (= 0 |main_#t~mem17.offset|)) (= |main_#t~mem17.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem17.base|)), 26108#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (= main_~x~0.offset 0))), 26109#(and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)))), 26110#(and (or (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 26111#(and (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (or (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (not (= |main_#t~mem20.offset| 0))))]
[2018-02-02 10:34:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:18,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states
[2018-02-02 10:34:18,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2018-02-02 10:34:18,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:34:18,783 INFO L87 Difference]: Start difference. First operand 249 states and 264 transitions. Second operand 28 states.
[2018-02-02 10:34:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:19,920 INFO L93 Difference]: Finished difference Result 280 states and 289 transitions.
[2018-02-02 10:34:19,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:34:19,920 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 70
[2018-02-02 10:34:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:19,921 INFO L225 Difference]: With dead ends: 280
[2018-02-02 10:34:19,921 INFO L226 Difference]: Without dead ends: 280
[2018-02-02 10:34:19,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=2376, Unknown=0, NotChecked=0, Total=2652
[2018-02-02 10:34:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states.
[2018-02-02 10:34:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256.
[2018-02-02 10:34:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-02-02 10:34:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 271 transitions.
[2018-02-02 10:34:19,923 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 271 transitions. Word has length 70
[2018-02-02 10:34:19,923 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:19,923 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 271 transitions.
[2018-02-02 10:34:19,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2018-02-02 10:34:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 271 transitions.
[2018-02-02 10:34:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-02-02 10:34:19,923 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:19,923 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:19,924 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2091544837, now seen corresponding path program 1 times
[2018-02-02 10:34:19,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:19,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:20,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:20,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:34:20,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:20,165 INFO L182 omatonBuilderFactory]: Interpolants [26720#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)), 26721#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 26722#(= 0 |main_#t~mem22.offset|), 26701#true, 26702#false, 26703#(= 1 (select |#valid| main_~head~0.base)), 26704#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26705#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 26706#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26707#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 26708#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 26709#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 26710#(and (= 0 |main_#t~malloc9.offset|) (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 26711#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 26712#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 26713#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26714#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 26715#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base))), 26716#(or (not (= 0 |main_#t~mem14|)) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base))), 26717#(and (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 26718#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 26719#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))]
[2018-02-02 10:34:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:20,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 10:34:20,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 10:34:20,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:34:20,165 INFO L87 Difference]: Start difference. First operand 256 states and 271 transitions. Second operand 22 states.
[2018-02-02 10:34:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:20,818 INFO L93 Difference]: Finished difference Result 268 states and 278 transitions.
[2018-02-02 10:34:20,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 10:34:20,819 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71
[2018-02-02 10:34:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:20,819 INFO L225 Difference]: With dead ends: 268
[2018-02-02 10:34:20,819 INFO L226 Difference]: Without dead ends: 268
[2018-02-02 10:34:20,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482
[2018-02-02 10:34:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states.
[2018-02-02 10:34:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256.
[2018-02-02 10:34:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-02-02 10:34:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 270 transitions.
[2018-02-02 10:34:20,821 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 270 transitions. Word has length 71
[2018-02-02 10:34:20,821 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:20,821 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 270 transitions.
[2018-02-02 10:34:20,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 10:34:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 270 transitions.
[2018-02-02 10:34:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-02-02 10:34:20,822 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:20,822 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:20,822 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2091544838, now seen corresponding path program 1 times
[2018-02-02 10:34:20,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:20,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:21,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:21,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28
[2018-02-02 10:34:21,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:21,243 INFO L182 omatonBuilderFactory]: Interpolants [27281#true, 27282#false, 27283#(not (= 0 |main_#t~malloc0.base|)), 27284#(not (= 0 main_~head~0.base)), 27285#(and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base))), 27286#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 27287#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 27288#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27289#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (not (= 0 main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 27290#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 27291#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 27292#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base))), 27293#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 27294#(and (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 27295#(and (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 27296#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 27297#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 27298#(or (not (= 0 |main_#t~mem14|)) (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base))), 27299#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|))) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 27300#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 27301#(and (not (= main_~head~0.base |main_#t~mem17.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem17.base|) (not (= 0 main_~head~0.base))), 27302#(and (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27303#(and (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 27304#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 27305#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 main_~head~0.base))), 27306#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (not (= 0 main_~head~0.base))), 27307#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~head~0.base))), 27308#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 27309#(= (select |#valid| |main_#t~mem22.base|) 1)]
[2018-02-02 10:34:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:21,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-02-02 10:34:21,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-02-02 10:34:21,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:34:21,243 INFO L87 Difference]: Start difference. First operand 256 states and 270 transitions. Second operand 29 states.
[2018-02-02 10:34:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:22,272 INFO L93 Difference]: Finished difference Result 289 states and 299 transitions.
[2018-02-02 10:34:22,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:34:22,273 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 71
[2018-02-02 10:34:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:22,273 INFO L225 Difference]: With dead ends: 289
[2018-02-02 10:34:22,273 INFO L226 Difference]: Without dead ends: 289
[2018-02-02 10:34:22,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=424, Invalid=2546, Unknown=0, NotChecked=0, Total=2970
[2018-02-02 10:34:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2018-02-02 10:34:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 256.
[2018-02-02 10:34:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-02-02 10:34:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 269 transitions.
[2018-02-02 10:34:22,275 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 269 transitions. Word has length 71
[2018-02-02 10:34:22,276 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:22,276 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 269 transitions.
[2018-02-02 10:34:22,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-02-02 10:34:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 269 transitions.
[2018-02-02 10:34:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-02-02 10:34:22,276 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:22,276 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:22,277 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash -60289681, now seen corresponding path program 2 times
[2018-02-02 10:34:22,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:22,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:22,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:22,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2018-02-02 10:34:22,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:22,731 INFO L182 omatonBuilderFactory]: Interpolants [27907#true, 27908#false, 27909#(= 0 |main_#t~malloc0.offset|), 27910#(= main_~head~0.offset 0), 27911#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 27912#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 27913#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 27914#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))) (not (= |main_#t~malloc4.base| main_~x~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 27915#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 27916#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= |main_#t~mem6.base| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 27917#(and (= 0 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 27918#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 27919#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 27920#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 27921#(and (= 0 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 27922#(and (= 0 |main_#t~malloc9.offset|) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 27923#(and (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 27924#(and (= |main_#t~mem11.offset| 0) (or (= 0 (select (select (store |#memory_int| |main_#t~mem11.base| (store (select |#memory_int| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) 2)) main_~head~0.base) (+ main_~head~0.offset 4))) (= |main_#t~mem11.base| main_~head~0.base)) (= main_~head~0.offset 0)), 27925#(and (or (= (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4)) 2) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 27926#(and (or (= (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4)) 2) (and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base))) (= main_~head~0.offset 0)), 27927#(and (or (not (= 1 (select |#valid| main_~x~0.base))) (not (= (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4)) (select |#valid| main_~x~0.base)))) (= main_~head~0.offset 0)), 27928#(and (not (= (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4)) 1)) (= main_~head~0.offset 0)), 27929#(not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 1)), 27930#(not (= |main_#t~mem19| 1))]
[2018-02-02 10:34:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:22,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 10:34:22,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 10:34:22,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:34:22,732 INFO L87 Difference]: Start difference. First operand 256 states and 269 transitions. Second operand 24 states.
[2018-02-02 10:34:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:23,243 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions.
[2018-02-02 10:34:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:34:23,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71
[2018-02-02 10:34:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:23,244 INFO L225 Difference]: With dead ends: 248
[2018-02-02 10:34:23,244 INFO L226 Difference]: Without dead ends: 234
[2018-02-02 10:34:23,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892
[2018-02-02 10:34:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states.
[2018-02-02 10:34:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228.
[2018-02-02 10:34:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states.
[2018-02-02 10:34:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 237 transitions.
[2018-02-02 10:34:23,245 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 237 transitions. Word has length 71
[2018-02-02 10:34:23,246 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:23,246 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 237 transitions.
[2018-02-02 10:34:23,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 10:34:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 237 transitions.
[2018-02-02 10:34:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-02-02 10:34:23,246 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:23,246 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:23,246 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash -70100121, now seen corresponding path program 1 times
[2018-02-02 10:34:23,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:23,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:34:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:23,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:34:23,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:34:23,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:34:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:23,486 INFO L182 omatonBuilderFactory]: Interpolants [28448#false, 28449#(= 1 (select |#valid| main_~head~0.base)), 28450#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 28451#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 28452#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28453#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 28454#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 28455#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 28456#(and (not (= main_~x~0.base |main_#t~malloc9.base|)) (not (= main_~head~0.base |main_#t~malloc9.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc9.offset|)) main_~head~0.base) main_~head~0.offset))), 28457#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 28458#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem11.base| main_~head~0.base))), 28459#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 28460#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))))), 28461#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)))))), 28462#(or (not (= 0 |main_#t~mem14|)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)))))), 28463#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 28464#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28465#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 28466#(not (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 28467#(not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 28468#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 28469#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base |main_#t~mem22.base|))), 28470#(= 1 (select |#valid| main_~x~0.base)), 28447#true]
[2018-02-02 10:34:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:34:23,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 10:34:23,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 10:34:23,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:34:23,487 INFO L87 Difference]: Start difference. First operand 228 states and 237 transitions. Second operand 24 states.
[2018-02-02 10:34:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:34:24,137 INFO L93 Difference]: Finished difference Result 237 states and 244 transitions.
[2018-02-02 10:34:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 10:34:24,137 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73
[2018-02-02 10:34:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:34:24,138 INFO L225 Difference]: With dead ends: 237
[2018-02-02 10:34:24,138 INFO L226 Difference]: Without dead ends: 237
[2018-02-02 10:34:24,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1667, Unknown=0, NotChecked=0, Total=1980
[2018-02-02 10:34:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states.
[2018-02-02 10:34:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228.
[2018-02-02 10:34:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states.
[2018-02-02 10:34:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 236 transitions.
[2018-02-02 10:34:24,140 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 236 transitions. Word has length 73
[2018-02-02 10:34:24,140 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:34:24,140 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 236 transitions.
[2018-02-02 10:34:24,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 10:34:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 236 transitions.
[2018-02-02 10:34:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-02-02 10:34:24,140 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:34:24,140 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:34:24,140 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 10:34:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -162072200, now seen corresponding path program 4 times
[2018-02-02 10:34:24,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:34:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:34:24,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
Received shutdown request...
[2018-02-02 10:34:24,188 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver:
de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded
at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265)
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.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131)
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-02 10:34:24,191 INFO L168 Benchmark]: Toolchain (without parser) took 51209.34 ms. Allocated memory was 411.0 MB in the beginning and 1.1 GB in the end (delta: 691.5 MB). Free memory was 367.9 MB in the beginning and 844.8 MB in the end (delta: -476.9 MB). Peak memory consumption was 214.7 MB. Max. memory is 5.3 GB.
[2018-02-02 10:34:24,192 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 411.0 MB. Free memory is still 374.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:34:24,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.68 ms. Allocated memory is still 411.0 MB. Free memory was 367.9 MB in the beginning and 356.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB.
[2018-02-02 10:34:24,192 INFO L168 Benchmark]: Boogie Preprocessor took 31.62 ms. Allocated memory is still 411.0 MB. Free memory was 356.0 MB in the beginning and 354.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 10:34:24,193 INFO L168 Benchmark]: RCFGBuilder took 379.41 ms. Allocated memory is still 411.0 MB. Free memory was 354.7 MB in the beginning and 322.1 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB.
[2018-02-02 10:34:24,193 INFO L168 Benchmark]: TraceAbstraction took 50628.73 ms. Allocated memory was 411.0 MB in the beginning and 1.1 GB in the end (delta: 691.5 MB). Free memory was 322.1 MB in the beginning and 844.8 MB in the end (delta: -522.7 MB). Peak memory consumption was 168.8 MB. Max. memory is 5.3 GB.
[2018-02-02 10:34:24,194 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.10 ms. Allocated memory is still 411.0 MB. Free memory is still 374.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 166.68 ms. Allocated memory is still 411.0 MB. Free memory was 367.9 MB in the beginning and 356.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 31.62 ms. Allocated memory is still 411.0 MB. Free memory was 356.0 MB in the beginning and 354.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 379.41 ms. Allocated memory is still 411.0 MB. Free memory was 354.7 MB in the beginning and 322.1 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 50628.73 ms. Allocated memory was 411.0 MB in the beginning and 1.1 GB in the end (delta: 691.5 MB). Free memory was 322.1 MB in the beginning and 844.8 MB in the end (delta: -522.7 MB). Peak memory consumption was 168.8 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: SMTLIBException: Timeout exceeded
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265)
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/sll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-34-24-201.csv
Completed graceful shutdown