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/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:01:57,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:01:57,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:01:57,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:01:57,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:01:57,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:01:57,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:01:57,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:01:57,161 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:01:57,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:01:57,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:01:57,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:01:57,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:01:57,164 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:01:57,165 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:01:57,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:01:57,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:01:57,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:01:57,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:01:57,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:01:57,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:01:57,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:01:57,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:01:57,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:01:57,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:01:57,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:01:57,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:01:57,177 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:01:57,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:01:57,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:01:57,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:01:57,178 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:01:57,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:01:57,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:01:57,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:01:57,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:01:57,188 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:01:57,188 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:01:57,188 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:01:57,189 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:01:57,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:01:57,189 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:01:57,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:01:57,189 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:01:57,189 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:01:57,189 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:01:57,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:01:57,190 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:01:57,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:01:57,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:01:57,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:01:57,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:01:57,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:01:57,191 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:01:57,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:01:57,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:01:57,237 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:01:57,239 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:01:57,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:01:57,240 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:01:57,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-02-02 10:01:57,362 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:01:57,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:01:57,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:01:57,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:01:57,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:01:57,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93c6caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57, skipping insertion in model container [2018-02-02 10:01:57,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,391 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:01:57,419 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:01:57,498 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:01:57,512 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:01:57,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57 WrapperNode [2018-02-02 10:01:57,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:01:57,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:01:57,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:01:57,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:01:57,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (1/1) ... [2018-02-02 10:01:57,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:01:57,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:01:57,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:01:57,549 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:01:57,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (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:01:57,588 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:01:57,588 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:01:57,588 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:01:57,588 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:01:57,588 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:01:57,588 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:01:57,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:01:57,919 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:01:57,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:01:57 BoogieIcfgContainer [2018-02-02 10:01:57,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:01:57,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:01:57,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:01:57,922 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:01:57,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:01:57" (1/3) ... [2018-02-02 10:01:57,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c485e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:01:57, skipping insertion in model container [2018-02-02 10:01:57,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:57" (2/3) ... [2018-02-02 10:01:57,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c485e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:01:57, skipping insertion in model container [2018-02-02 10:01:57,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:01:57" (3/3) ... [2018-02-02 10:01:57,925 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-02-02 10:01:57,930 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:01:57,936 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-02 10:01:57,961 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:01:57,961 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:01:57,961 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:01:57,961 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:01:57,961 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:01:57,961 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:01:57,961 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:01:57,961 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:01:57,962 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:01:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-02-02 10:01:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:01:57,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:57,982 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:57,983 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247859, now seen corresponding path program 1 times [2018-02-02 10:01:58,020 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:58,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:58,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:01:58,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:58,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:58,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:58,092 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:01:58,092 INFO L182 omatonBuilderFactory]: Interpolants [150#true, 151#false, 152#(= 1 (select |#valid| |main_#t~malloc0.base|)), 153#(= 1 (select |#valid| main_~root~0.base))] [2018-02-02 10:01:58,092 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:01:58,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:58,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:58,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:58,103 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 4 states. [2018-02-02 10:01:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:58,396 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-02-02 10:01:58,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:58,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:01:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:58,405 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:01:58,406 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:01:58,407 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:01:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:01:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2018-02-02 10:01:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:01:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-02-02 10:01:58,438 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 8 [2018-02-02 10:01:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:58,438 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-02-02 10:01:58,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-02-02 10:01:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:01:58,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:58,439 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:58,439 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247858, now seen corresponding path program 1 times [2018-02-02 10:01:58,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:58,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:58,497 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:01:58,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:58,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:58,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:58,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:01:58,498 INFO L182 omatonBuilderFactory]: Interpolants [460#true, 461#false, 462#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 463#(and (= (select |#length| main_~root~0.base) 8) (= main_~root~0.offset 0))] [2018-02-02 10:01:58,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:01:58,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:58,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:58,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:58,500 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 4 states. [2018-02-02 10:01:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:58,611 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-02-02 10:01:58,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:58,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:01:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:58,613 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:01:58,613 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:01:58,614 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:01:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:01:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 10:01:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:01:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-02-02 10:01:58,621 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 8 [2018-02-02 10:01:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:58,621 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-02-02 10:01:58,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-02-02 10:01:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:01:58,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:58,622 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:58,622 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:58,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213562, now seen corresponding path program 1 times [2018-02-02 10:01:58,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:58,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:58,665 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:01:58,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:58,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:58,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:58,666 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:01:58,666 INFO L182 omatonBuilderFactory]: Interpolants [746#true, 747#false, 748#(= 1 (select |#valid| main_~root~0.base)), 749#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:01:58,666 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:01:58,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:58,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:58,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:58,667 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 4 states. [2018-02-02 10:01:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:58,795 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-02-02 10:01:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:58,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:01:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:58,796 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:01:58,796 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:01:58,796 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:01:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:01:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-02-02 10:01:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:01:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-02-02 10:01:58,800 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 14 [2018-02-02 10:01:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:58,800 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-02-02 10:01:58,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-02-02 10:01:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:01:58,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:58,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:58,801 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213563, now seen corresponding path program 1 times [2018-02-02 10:01:58,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:58,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:58,859 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:01:58,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:58,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:58,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:58,860 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:01:58,860 INFO L182 omatonBuilderFactory]: Interpolants [1027#true, 1028#false, 1029#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1030#(and (= 0 main_~root~0.offset) (= 8 (select |#length| main_~root~0.base))), 1031#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:01:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:58,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:58,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:58,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:58,861 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 5 states. [2018-02-02 10:01:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,014 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2018-02-02 10:01:59,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:59,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:01:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,017 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:01:59,017 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:01:59,017 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:01:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:01:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2018-02-02 10:01:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:01:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 10:01:59,025 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 14 [2018-02-02 10:01:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,026 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 10:01:59,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 10:01:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:01:59,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,026 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:59,026 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097560, now seen corresponding path program 1 times [2018-02-02 10:01:59,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:59,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:01:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:59,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:59,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:59,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:59,059 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:01:59,059 INFO L182 omatonBuilderFactory]: Interpolants [1366#true, 1367#false, 1368#(= 1 (select |#valid| |main_#t~malloc28.base|)), 1369#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 10:01:59,059 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:01:59,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:59,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:59,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:59,060 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 4 states. [2018-02-02 10:01:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,137 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2018-02-02 10:01:59,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:59,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:01:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,139 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:01:59,139 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:01:59,139 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:01:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:01:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2018-02-02 10:01:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:01:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-02-02 10:01:59,145 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 16 [2018-02-02 10:01:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,146 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-02-02 10:01:59,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-02-02 10:01:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:01:59,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,147 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:59,147 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097561, now seen corresponding path program 1 times [2018-02-02 10:01:59,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:59,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:59,205 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:01:59,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:59,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:59,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:59,206 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:01:59,206 INFO L182 omatonBuilderFactory]: Interpolants [1700#true, 1701#false, 1702#(and (= 0 |main_#t~malloc28.offset|) (= 8 (select |#length| |main_#t~malloc28.base|))), 1703#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0))] [2018-02-02 10:01:59,206 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:01:59,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:59,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:59,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:59,207 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 4 states. [2018-02-02 10:01:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,287 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2018-02-02 10:01:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:59,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:01:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,288 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:01:59,288 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:01:59,288 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:01:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:01:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-02-02 10:01:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:01:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-02-02 10:01:59,293 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 16 [2018-02-02 10:01:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,294 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-02-02 10:01:59,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-02-02 10:01:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:01:59,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:59,294 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 990226269, now seen corresponding path program 1 times [2018-02-02 10:01:59,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:59,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:01:59,332 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:01:59,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:59,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:59,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:59,333 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:01:59,333 INFO L182 omatonBuilderFactory]: Interpolants [2022#true, 2023#false, 2024#(not (= 0 |main_#t~malloc28.base|)), 2025#(not (= 0 main_~s~0.base))] [2018-02-02 10:01:59,333 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:01:59,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:59,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:59,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:59,334 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 4 states. [2018-02-02 10:01:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,356 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2018-02-02 10:01:59,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:59,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 10:01:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,358 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:01:59,358 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:01:59,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:01:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-02-02 10:01:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:01:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2018-02-02 10:01:59,363 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 21 [2018-02-02 10:01:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,363 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2018-02-02 10:01:59,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2018-02-02 10:01:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:01:59,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,364 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:59,364 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 632244512, now seen corresponding path program 1 times [2018-02-02 10:01:59,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:59,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:59,405 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:01:59,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:59,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:59,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:59,406 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:01:59,406 INFO L182 omatonBuilderFactory]: Interpolants [2341#true, 2342#false, 2343#(= 1 (select |#valid| main_~s~0.base)), 2344#(and (= main_~s~0.base main_~st~0.base) (= 1 (select |#valid| main_~s~0.base))), 2345#(= 1 (select |#valid| main_~st~0.base))] [2018-02-02 10:01:59,406 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:01:59,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:59,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:59,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:59,407 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand 5 states. [2018-02-02 10:01:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,506 INFO L93 Difference]: Finished difference Result 171 states and 195 transitions. [2018-02-02 10:01:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:59,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 10:01:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,507 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:01:59,507 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:01:59,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:01:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:01:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2018-02-02 10:01:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:01:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-02-02 10:01:59,511 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 22 [2018-02-02 10:01:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,511 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-02-02 10:01:59,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-02-02 10:01:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:01:59,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,512 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:59,513 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash 632244513, now seen corresponding path program 1 times [2018-02-02 10:01:59,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:59,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:59,566 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:01:59,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:59,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:59,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:59,567 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:01:59,567 INFO L182 omatonBuilderFactory]: Interpolants [2674#true, 2675#false, 2676#(and (= 0 |main_#t~malloc28.offset|) (= 8 (select |#length| |main_#t~malloc28.base|))), 2677#(and (= 0 main_~s~0.offset) (= 8 (select |#length| main_~s~0.base))), 2678#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 10:01:59,568 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:01:59,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:59,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:59,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:59,568 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 5 states. [2018-02-02 10:01:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,699 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-02-02 10:01:59,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:59,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 10:01:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,700 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:01:59,700 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:01:59,700 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:01:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:01:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2018-02-02 10:01:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:01:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 10:01:59,703 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 22 [2018-02-02 10:01:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,704 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 10:01:59,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 10:01:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:01:59,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,704 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] [2018-02-02 10:01:59,705 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash -733762389, now seen corresponding path program 1 times [2018-02-02 10:01:59,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:59,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:59,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:59,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:59,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:59,723 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:01:59,723 INFO L182 omatonBuilderFactory]: Interpolants [3017#true, 3018#false, 3019#(not |main_#t~short6|)] [2018-02-02 10:01:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:59,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:01:59,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:01:59,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:59,724 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 3 states. [2018-02-02 10:01:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,730 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2018-02-02 10:01:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:01:59,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 10:01:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,732 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:01:59,732 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:01:59,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:01:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 10:01:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:01:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2018-02-02 10:01:59,735 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 22 [2018-02-02 10:01:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,735 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2018-02-02 10:01:59,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:01:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2018-02-02 10:01:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:01:59,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,736 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] [2018-02-02 10:01:59,736 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1797349272, now seen corresponding path program 1 times [2018-02-02 10:01:59,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:59,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:59,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:59,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:01:59,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:59,835 INFO L182 omatonBuilderFactory]: Interpolants [3338#true, 3339#false, 3340#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset))), 3341#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 3342#(and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)), 3343#(not |main_#t~short6|)] [2018-02-02 10:01:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:59,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:01:59,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:01:59,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:01:59,836 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand 6 states. [2018-02-02 10:01:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:59,982 INFO L93 Difference]: Finished difference Result 202 states and 232 transitions. [2018-02-02 10:01:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:01:59,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:01:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:59,987 INFO L225 Difference]: With dead ends: 202 [2018-02-02 10:01:59,987 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:01:59,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:01:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:01:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2018-02-02 10:01:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:01:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2018-02-02 10:01:59,994 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 24 [2018-02-02 10:01:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:59,994 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2018-02-02 10:01:59,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:01:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2018-02-02 10:01:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:01:59,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:59,995 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] [2018-02-02 10:01:59,995 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:59,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1764795143, now seen corresponding path program 1 times [2018-02-02 10:01:59,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:00,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:00,192 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:02:00,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:00,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:02:00,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:00,193 INFO L182 omatonBuilderFactory]: Interpolants [3728#false, 3729#(= 0 |main_#t~malloc0.offset|), 3730#(= main_~root~0.offset 0), 3731#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 3732#(and (= 0 |main_#t~malloc28.offset|) (= 1 (select (store |#valid| |main_#t~malloc28.base| 0) main_~root~0.base)) (not (= 0 |main_#t~malloc28.base|)) (= main_~root~0.offset 0)), 3733#(and (= 1 (select (store |#valid| main_~s~0.base 0) main_~root~0.base)) (= main_~root~0.offset main_~s~0.offset) (not (= 0 main_~s~0.base)) (= main_~root~0.offset 0)), 3734#(and (= 0 main_~s~0.offset) (not (= 0 main_~s~0.base)) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 3735#(and (not (= 0 main_~st~0.base)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 3736#(and (not (= 0 main_~st~0.base)) (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem32.base|))), 3737#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= 0 main_~st~0.base))), 3738#(= 1 (select |#valid| main_~n~0.base)), 3727#true] [2018-02-02 10:02:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:00,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:02:00,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:02:00,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:02:00,194 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 12 states. [2018-02-02 10:02:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:00,630 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2018-02-02 10:02:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:02:00,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-02 10:02:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:00,631 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:02:00,631 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:02:00,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:02:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:02:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-02-02 10:02:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:02:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2018-02-02 10:02:00,634 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 25 [2018-02-02 10:02:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:00,634 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2018-02-02 10:02:00,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:02:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2018-02-02 10:02:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:02:00,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:00,635 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] [2018-02-02 10:02:00,635 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1764795144, now seen corresponding path program 1 times [2018-02-02 10:02:00,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:00,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:00,849 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:02:00,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:00,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:02:00,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:00,850 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:02:00,850 INFO L182 omatonBuilderFactory]: Interpolants [4130#true, 4131#false, 4132#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 4133#(and (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 4134#(and (= 0 |main_#t~malloc28.offset|) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 4135#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 4136#(and (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))))), 4137#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 4138#(and (= 0 |main_#t~mem32.offset|) (= 8 (select |#length| |main_#t~mem32.base|)) (= main_~st~0.offset 0)), 4139#(and (= main_~n~0.offset 0) (= main_~st~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 4140#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:02:00,850 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:02:00,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:02:00,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:02:00,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:02:00,850 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand 11 states. [2018-02-02 10:02:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:01,247 INFO L93 Difference]: Finished difference Result 240 states and 267 transitions. [2018-02-02 10:02:01,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:02:01,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-02 10:02:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:01,248 INFO L225 Difference]: With dead ends: 240 [2018-02-02 10:02:01,248 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 10:02:01,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:02:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 10:02:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2018-02-02 10:02:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 10:02:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 228 transitions. [2018-02-02 10:02:01,253 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 228 transitions. Word has length 25 [2018-02-02 10:02:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:01,253 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 228 transitions. [2018-02-02 10:02:01,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:02:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 228 transitions. [2018-02-02 10:02:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:02:01,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:01,254 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:01,254 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2572345, now seen corresponding path program 1 times [2018-02-02 10:02:01,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:01,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:01,287 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:02:01,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:01,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:02:01,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:01,288 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:02:01,288 INFO L182 omatonBuilderFactory]: Interpolants [4597#true, 4598#false, 4599#(= 1 (select |#valid| |main_#t~malloc13.base|)), 4600#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 4601#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-02 10:02:01,289 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:02:01,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:01,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:01,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:01,289 INFO L87 Difference]: Start difference. First operand 192 states and 228 transitions. Second operand 5 states. [2018-02-02 10:02:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:01,421 INFO L93 Difference]: Finished difference Result 276 states and 328 transitions. [2018-02-02 10:02:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:02:01,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 10:02:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:01,422 INFO L225 Difference]: With dead ends: 276 [2018-02-02 10:02:01,422 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 10:02:01,422 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:02:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 10:02:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 191. [2018-02-02 10:02:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 10:02:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 226 transitions. [2018-02-02 10:02:01,426 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 226 transitions. Word has length 25 [2018-02-02 10:02:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:01,427 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 226 transitions. [2018-02-02 10:02:01,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 226 transitions. [2018-02-02 10:02:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:02:01,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:01,427 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] [2018-02-02 10:02:01,428 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2572346, now seen corresponding path program 1 times [2018-02-02 10:02:01,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:01,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:01,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:02:01,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:01,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:02:01,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:01,470 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:02:01,470 INFO L182 omatonBuilderFactory]: Interpolants [5075#true, 5076#false, 5077#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 5078#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 5079#(and (= (select |#length| |main_#t~mem15.base|) 8) (= |main_#t~mem15.offset| 0))] [2018-02-02 10:02:01,471 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:02:01,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:01,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:01,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:01,471 INFO L87 Difference]: Start difference. First operand 191 states and 226 transitions. Second operand 5 states. [2018-02-02 10:02:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:01,668 INFO L93 Difference]: Finished difference Result 336 states and 397 transitions. [2018-02-02 10:02:01,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:02:01,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 10:02:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:01,669 INFO L225 Difference]: With dead ends: 336 [2018-02-02 10:02:01,669 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 10:02:01,669 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:02:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 10:02:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 190. [2018-02-02 10:02:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 10:02:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2018-02-02 10:02:01,673 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 25 [2018-02-02 10:02:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:01,673 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2018-02-02 10:02:01,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2018-02-02 10:02:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:02:01,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:01,674 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] [2018-02-02 10:02:01,674 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash -676623804, now seen corresponding path program 1 times [2018-02-02 10:02:01,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:01,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:01,764 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:02:01,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:01,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:02:01,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:01,764 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:02:01,764 INFO L182 omatonBuilderFactory]: Interpolants [5616#(and (= 1 (select |#valid| |main_#t~malloc13.base|)) (not (= main_~n~0.base |main_#t~malloc13.base|))), 5617#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 5618#(and (not (= main_~n~0.base |main_#t~mem15.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 5619#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 5620#(= 1 (select |#valid| |main_#t~mem17.base|)), 5612#true, 5613#false, 5614#(= (select |#valid| main_~root~0.base) 1), 5615#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 10:02:01,765 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:02:01,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:02:01,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:02:01,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:02:01,765 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 9 states. [2018-02-02 10:02:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:02,387 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-02-02 10:02:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:02:02,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:02:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:02,388 INFO L225 Difference]: With dead ends: 227 [2018-02-02 10:02:02,388 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 10:02:02,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:02:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 10:02:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 189. [2018-02-02 10:02:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 10:02:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2018-02-02 10:02:02,393 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 28 [2018-02-02 10:02:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:02,393 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2018-02-02 10:02:02,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:02:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2018-02-02 10:02:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:02:02,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:02,394 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] [2018-02-02 10:02:02,394 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:02,394 INFO L82 PathProgramCache]: Analyzing trace with hash -676623803, now seen corresponding path program 1 times [2018-02-02 10:02:02,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:02,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:02,493 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:02:02,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:02,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:02:02,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:02,493 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:02:02,493 INFO L182 omatonBuilderFactory]: Interpolants [6049#true, 6050#false, 6051#(= (select |#valid| main_~root~0.base) 1), 6052#(= (select |#valid| main_~n~0.base) 1), 6053#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 6054#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 6055#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 6056#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 6057#(and (= (select |#length| |main_#t~mem17.base|) 8) (= |main_#t~mem17.offset| 0))] [2018-02-02 10:02:02,494 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:02:02,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:02:02,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:02:02,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:02:02,494 INFO L87 Difference]: Start difference. First operand 189 states and 222 transitions. Second operand 9 states. [2018-02-02 10:02:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:02,798 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2018-02-02 10:02:02,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:02:02,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:02:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:02,799 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:02:02,799 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:02:02,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:02:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:02:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 188. [2018-02-02 10:02:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:02:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-02-02 10:02:02,802 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 28 [2018-02-02 10:02:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:02,802 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-02-02 10:02:02,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:02:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-02-02 10:02:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:02:02,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:02,802 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] [2018-02-02 10:02:02,802 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1254885066, now seen corresponding path program 1 times [2018-02-02 10:02:02,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:02,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:02:02,826 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:02:02,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:02,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:02:02,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:02,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:02:02,827 INFO L182 omatonBuilderFactory]: Interpolants [6484#true, 6485#false, 6486#(and (= 8 (select |#length| |main_#t~malloc34.base|)) (= 0 |main_#t~malloc34.offset|)), 6487#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 10:02:02,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:02:02,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:02:02,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:02:02,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:02:02,828 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 4 states. [2018-02-02 10:02:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:02,968 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2018-02-02 10:02:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:02:02,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 10:02:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:02,970 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:02:02,970 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 10:02:02,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 10:02:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 186. [2018-02-02 10:02:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:02:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2018-02-02 10:02:02,974 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 29 [2018-02-02 10:02:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:02,974 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2018-02-02 10:02:02,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:02:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2018-02-02 10:02:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:02:02,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:02,975 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] [2018-02-02 10:02:02,975 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1254885065, now seen corresponding path program 1 times [2018-02-02 10:02:02,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:02,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:02,999 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:02:02,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:02,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:02:02,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:02,999 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:02:03,000 INFO L182 omatonBuilderFactory]: Interpolants [6920#true, 6921#false, 6922#(= 1 (select |#valid| |main_#t~malloc34.base|)), 6923#(= 1 (select |#valid| main_~st~0.base))] [2018-02-02 10:02:03,000 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:02:03,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:02:03,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:02:03,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:02:03,000 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand 4 states. [2018-02-02 10:02:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:03,077 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2018-02-02 10:02:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:02:03,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 10:02:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:03,078 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:02:03,078 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:02:03,078 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:02:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:02:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2018-02-02 10:02:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:02:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2018-02-02 10:02:03,081 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 29 [2018-02-02 10:02:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:03,081 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2018-02-02 10:02:03,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:02:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2018-02-02 10:02:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:02:03,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:03,081 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] [2018-02-02 10:02:03,081 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash 570395414, now seen corresponding path program 1 times [2018-02-02 10:02:03,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:03,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:03,102 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:02:03,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:03,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:02:03,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:03,102 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:02:03,103 INFO L182 omatonBuilderFactory]: Interpolants [7323#true, 7324#false, 7325#(= 1 (select |#valid| |main_#t~malloc22.base|)), 7326#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 7327#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 10:02:03,103 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:02:03,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:03,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:03,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:03,103 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand 5 states. [2018-02-02 10:02:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:03,282 INFO L93 Difference]: Finished difference Result 267 states and 310 transitions. [2018-02-02 10:02:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:02:03,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:02:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:03,284 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:02:03,284 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:02:03,284 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:02:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:02:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 184. [2018-02-02 10:02:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:02:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2018-02-02 10:02:03,288 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2018-02-02 10:02:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:03,288 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2018-02-02 10:02:03,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2018-02-02 10:02:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:02:03,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:03,289 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] [2018-02-02 10:02:03,289 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash 570395415, now seen corresponding path program 1 times [2018-02-02 10:02:03,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:03,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:03,336 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:02:03,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:03,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:02:03,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:03,337 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:02:03,337 INFO L182 omatonBuilderFactory]: Interpolants [7785#true, 7786#false, 7787#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 7788#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 7789#(and (= (select |#length| |main_#t~mem24.base|) 8) (= |main_#t~mem24.offset| 0))] [2018-02-02 10:02:03,337 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:02:03,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:03,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:03,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:03,338 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand 5 states. [2018-02-02 10:02:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:03,660 INFO L93 Difference]: Finished difference Result 324 states and 373 transitions. [2018-02-02 10:02:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:02:03,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:02:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:03,661 INFO L225 Difference]: With dead ends: 324 [2018-02-02 10:02:03,661 INFO L226 Difference]: Without dead ends: 324 [2018-02-02 10:02:03,662 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:02:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-02 10:02:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 183. [2018-02-02 10:02:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:02:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2018-02-02 10:02:03,664 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 29 [2018-02-02 10:02:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:03,664 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2018-02-02 10:02:03,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2018-02-02 10:02:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:02:03,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:03,664 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:03,665 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash -526012245, now seen corresponding path program 1 times [2018-02-02 10:02:03,665 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:03,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:03,686 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:02:03,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:03,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:02:03,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:03,687 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:02:03,687 INFO L182 omatonBuilderFactory]: Interpolants [8304#false, 8305#(= 1 (select |#valid| |main_#t~malloc39.base|)), 8306#(= 1 (select |#valid| main_~st~0.base)), 8303#true] [2018-02-02 10:02:03,687 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:02:03,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:02:03,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:02:03,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:02:03,687 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand 4 states. [2018-02-02 10:02:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:03,747 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2018-02-02 10:02:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:02:03,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 10:02:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:03,749 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:02:03,749 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:02:03,749 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:02:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:02:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-02-02 10:02:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:02:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-02-02 10:02:03,751 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 31 [2018-02-02 10:02:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:03,751 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-02-02 10:02:03,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:02:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-02-02 10:02:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:02:03,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:03,752 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:03,752 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -526012244, now seen corresponding path program 1 times [2018-02-02 10:02:03,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:03,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:03,777 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:02:03,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:03,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:02:03,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:03,777 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:02:03,777 INFO L182 omatonBuilderFactory]: Interpolants [8688#true, 8689#false, 8690#(and (= 8 (select |#length| |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)), 8691#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 10:02:03,778 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:02:03,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:02:03,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:02:03,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:02:03,778 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 4 states. [2018-02-02 10:02:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:04,049 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2018-02-02 10:02:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:02:04,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 10:02:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:04,050 INFO L225 Difference]: With dead ends: 220 [2018-02-02 10:02:04,050 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 10:02:04,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 10:02:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 180. [2018-02-02 10:02:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:02:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2018-02-02 10:02:04,052 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 31 [2018-02-02 10:02:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:04,052 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2018-02-02 10:02:04,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:02:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2018-02-02 10:02:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:02:04,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:04,053 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] [2018-02-02 10:02:04,053 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 886820396, now seen corresponding path program 1 times [2018-02-02 10:02:04,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:04,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:04,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:04,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:02:04,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:04,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:02:04,099 INFO L182 omatonBuilderFactory]: Interpolants [9095#true, 9096#false, 9097#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base) main_~s~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset) main_~s~0.offset))), 9098#(and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|)), 9099#(and (= 0 main_~s~0.base) (= main_~s~0.offset 0))] [2018-02-02 10:02:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:04,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:04,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:04,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:04,099 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand 5 states. [2018-02-02 10:02:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:04,138 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-02-02 10:02:04,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:02:04,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 10:02:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:04,139 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:02:04,139 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:02:04,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:02:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:02:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2018-02-02 10:02:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:02:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-02-02 10:02:04,141 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 32 [2018-02-02 10:02:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:04,141 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-02-02 10:02:04,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-02-02 10:02:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:02:04,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:04,142 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] [2018-02-02 10:02:04,142 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1759246890, now seen corresponding path program 1 times [2018-02-02 10:02:04,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:04,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:04,209 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:02:04,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:04,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:02:04,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:04,209 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:02:04,209 INFO L182 omatonBuilderFactory]: Interpolants [9478#true, 9479#false, 9480#(= (select |#valid| main_~root~0.base) 1), 9481#(= (select |#valid| main_~n~0.base) 1), 9482#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 9483#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 9484#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|))), 9485#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 9486#(and (= (select |#length| |main_#t~mem26.base|) 8) (= |main_#t~mem26.offset| 0))] [2018-02-02 10:02:04,209 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:02:04,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:02:04,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:02:04,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:02:04,210 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 9 states. [2018-02-02 10:02:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:04,516 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-02-02 10:02:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:02:04,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:02:04,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:04,517 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:02:04,517 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:02:04,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:02:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:02:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-02-02 10:02:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:02:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2018-02-02 10:02:04,519 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 32 [2018-02-02 10:02:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:04,519 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2018-02-02 10:02:04,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:02:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2018-02-02 10:02:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:02:04,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:04,520 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] [2018-02-02 10:02:04,520 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1759246889, now seen corresponding path program 1 times [2018-02-02 10:02:04,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:04,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:04,606 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:02:04,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:04,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:02:04,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:04,606 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:02:04,607 INFO L182 omatonBuilderFactory]: Interpolants [9875#true, 9876#false, 9877#(= (select |#valid| main_~root~0.base) 1), 9878#(= (select |#valid| main_~n~0.base) 1), 9879#(and (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|))), 9880#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 9881#(and (not (= main_~n~0.base |main_#t~mem24.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 9882#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 9883#(= 1 (select |#valid| |main_#t~mem26.base|))] [2018-02-02 10:02:04,607 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:02:04,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:02:04,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:02:04,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:02:04,607 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 9 states. [2018-02-02 10:02:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:04,886 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2018-02-02 10:02:04,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:02:04,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:02:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:04,887 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:02:04,887 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:02:04,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:02:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:02:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2018-02-02 10:02:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:02:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-02 10:02:04,890 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 32 [2018-02-02 10:02:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:04,891 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-02 10:02:04,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:02:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-02 10:02:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:02:04,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:04,891 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:02:04,891 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:04,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1721628592, now seen corresponding path program 1 times [2018-02-02 10:02:04,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:04,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:05,180 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:02:05,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:05,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:02:05,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:05,181 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:02:05,181 INFO L182 omatonBuilderFactory]: Interpolants [10272#(= 0 (select |#valid| 0)), 10273#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 10274#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 10275#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 10276#(and (= (store (store |#valid| |main_#t~malloc28.base| 0) main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 0 |main_#t~malloc28.offset|) (not (= 0 |main_#t~malloc28.base|)) (= main_~root~0.offset 0)), 10277#(and (= 0 (select |#valid| 0)) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~s~0.base 0) main_~root~0.base 0)) (= main_~root~0.offset 0)), 10278#(and (= 0 (select |#valid| 0)) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4)) 0))), 10279#(and (not (= 0 main_~st~0.base)) (= main_~s~0.offset main_~st~0.offset) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= (store (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) |old(#valid)|)), 10280#(and (not (= 0 main_~st~0.base)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= (store (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) |old(#valid)|)), 10281#(and (= (store (store |#valid| main_~st~0.base 0) |main_#t~mem32.base| 0) |old(#valid)|) (not (= 0 main_~st~0.base)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 10282#(and (not (= 0 main_~st~0.base)) (= |old(#valid)| (store (store |#valid| main_~st~0.base 0) main_~n~0.base 0)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 10283#(or (= 0 (select |#valid| main_~n~0.base)) (and (not (= main_~n~0.base 0)) (= |old(#valid)| (store |#valid| main_~n~0.base 0)))), 10284#(and (not (= main_~n~0.base 0)) (= |old(#valid)| (store |#valid| main_~n~0.base 0))), 10285#(= |#valid| |old(#valid)|), 10270#true, 10271#false] [2018-02-02 10:02:05,181 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:02:05,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:02:05,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:02:05,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:02:05,182 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 16 states. [2018-02-02 10:02:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:06,006 INFO L93 Difference]: Finished difference Result 212 states and 239 transitions. [2018-02-02 10:02:06,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:02:06,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-02-02 10:02:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:06,007 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:02:06,007 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 10:02:06,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:02:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 10:02:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2018-02-02 10:02:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:02:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 225 transitions. [2018-02-02 10:02:06,009 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 225 transitions. Word has length 33 [2018-02-02 10:02:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:06,009 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 225 transitions. [2018-02-02 10:02:06,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:02:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2018-02-02 10:02:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:02:06,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:06,009 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] [2018-02-02 10:02:06,009 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash 583502853, now seen corresponding path program 1 times [2018-02-02 10:02:06,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:06,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:06,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:02:06,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:06,057 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:02:06,057 INFO L182 omatonBuilderFactory]: Interpolants [10725#true, 10726#false, 10727#(= 1 (select |#valid| main_~n~0.base)), 10728#(and (not (= main_~n~0.base |main_#t~malloc39.base|)) (= 1 (select |#valid| |main_#t~malloc39.base|))), 10729#(and (= 1 (select |#valid| main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base))), 10730#(= 1 (select (store |#valid| main_~n~0.base 0) main_~s~0.base)), 10731#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 10:02:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:02:06,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:02:06,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:02:06,058 INFO L87 Difference]: Start difference. First operand 199 states and 225 transitions. Second operand 7 states. [2018-02-02 10:02:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:06,231 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2018-02-02 10:02:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:02:06,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 10:02:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:06,232 INFO L225 Difference]: With dead ends: 217 [2018-02-02 10:02:06,232 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 10:02:06,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:02:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 10:02:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2018-02-02 10:02:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:02:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-02-02 10:02:06,234 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 38 [2018-02-02 10:02:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:06,234 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-02-02 10:02:06,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:02:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-02-02 10:02:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:02:06,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:06,234 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] [2018-02-02 10:02:06,235 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 583502854, now seen corresponding path program 1 times [2018-02-02 10:02:06,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:06,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:06,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:02:06,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:06,283 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:02:06,283 INFO L182 omatonBuilderFactory]: Interpolants [11168#false, 11169#(and (= 8 (select |#length| |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)), 11170#(and (= 0 main_~st~0.offset) (= 8 (select |#length| main_~st~0.base))), 11171#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0)), 11167#true] [2018-02-02 10:02:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:06,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:06,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:06,284 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 5 states. [2018-02-02 10:02:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:06,402 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2018-02-02 10:02:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:02:06,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:02:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:06,403 INFO L225 Difference]: With dead ends: 262 [2018-02-02 10:02:06,403 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 10:02:06,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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:02:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 10:02:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2018-02-02 10:02:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:02:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2018-02-02 10:02:06,405 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 38 [2018-02-02 10:02:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:06,406 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2018-02-02 10:02:06,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2018-02-02 10:02:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:02:06,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:06,406 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] [2018-02-02 10:02:06,406 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1439020069, now seen corresponding path program 1 times [2018-02-02 10:02:06,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:06,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:06,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:02:06,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:06,460 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:02:06,461 INFO L182 omatonBuilderFactory]: Interpolants [11648#true, 11649#false, 11650#(= 1 (select |#valid| main_~n~0.base)), 11651#(and (not (= main_~n~0.base |main_#t~malloc34.base|)) (= 1 (select |#valid| |main_#t~malloc34.base|))), 11652#(and (= 1 (select |#valid| main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base))), 11653#(= 1 (select (store |#valid| main_~n~0.base 0) main_~s~0.base)), 11654#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 10:02:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:02:06,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:02:06,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:02:06,461 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand 7 states. [2018-02-02 10:02:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:06,671 INFO L93 Difference]: Finished difference Result 253 states and 283 transitions. [2018-02-02 10:02:06,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:02:06,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 10:02:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:06,672 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:02:06,672 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:02:06,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:02:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:02:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 216. [2018-02-02 10:02:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 10:02:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2018-02-02 10:02:06,674 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 38 [2018-02-02 10:02:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:06,675 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2018-02-02 10:02:06,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:02:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2018-02-02 10:02:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:02:06,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:06,675 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] [2018-02-02 10:02:06,675 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1439020070, now seen corresponding path program 1 times [2018-02-02 10:02:06,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:06,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:06,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:02:06,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:06,721 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:02:06,721 INFO L182 omatonBuilderFactory]: Interpolants [12144#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0)), 12140#true, 12141#false, 12142#(and (= 8 (select |#length| |main_#t~malloc34.base|)) (= 0 |main_#t~malloc34.offset|)), 12143#(and (= 0 main_~st~0.offset) (= 8 (select |#length| main_~st~0.base)))] [2018-02-02 10:02:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:06,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:06,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:06,721 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand 5 states. [2018-02-02 10:02:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:06,860 INFO L93 Difference]: Finished difference Result 295 states and 330 transitions. [2018-02-02 10:02:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:02:06,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:02:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:06,861 INFO L225 Difference]: With dead ends: 295 [2018-02-02 10:02:06,861 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 10:02:06,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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:02:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 10:02:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 209. [2018-02-02 10:02:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:02:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2018-02-02 10:02:06,863 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 38 [2018-02-02 10:02:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:06,863 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2018-02-02 10:02:06,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2018-02-02 10:02:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:02:06,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:06,863 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:06,863 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:06,864 INFO L82 PathProgramCache]: Analyzing trace with hash 908719351, now seen corresponding path program 1 times [2018-02-02 10:02:06,864 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:06,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:06,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:02:06,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:06,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:02:06,896 INFO L182 omatonBuilderFactory]: Interpolants [12657#true, 12658#false, 12659#(not (= 0 |main_#t~malloc39.base|)), 12660#(not (= 0 main_~st~0.base)), 12661#(not (= 0 main_~s~0.base))] [2018-02-02 10:02:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:06,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:06,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:06,897 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 5 states. [2018-02-02 10:02:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:06,932 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2018-02-02 10:02:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:02:06,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 10:02:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:06,933 INFO L225 Difference]: With dead ends: 279 [2018-02-02 10:02:06,933 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 10:02:06,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:02:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 10:02:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 213. [2018-02-02 10:02:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 10:02:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-02-02 10:02:06,935 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 39 [2018-02-02 10:02:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:06,935 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-02-02 10:02:06,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-02-02 10:02:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:02:06,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:06,936 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:06,936 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1659949271, now seen corresponding path program 1 times [2018-02-02 10:02:06,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:06,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:06,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:02:06,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:06,953 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:02:06,953 INFO L182 omatonBuilderFactory]: Interpolants [13160#true, 13161#false, 13162#(not (= 0 |main_#t~malloc34.base|)), 13163#(not (= 0 main_~st~0.base)), 13164#(not (= 0 main_~s~0.base))] [2018-02-02 10:02:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:06,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:02:06,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:02:06,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:02:06,954 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 5 states. [2018-02-02 10:02:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:06,997 INFO L93 Difference]: Finished difference Result 292 states and 325 transitions. [2018-02-02 10:02:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:02:06,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 10:02:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:06,997 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:02:06,998 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:02:06,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:02:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:02:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 209. [2018-02-02 10:02:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:02:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 238 transitions. [2018-02-02 10:02:07,000 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 238 transitions. Word has length 39 [2018-02-02 10:02:07,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:07,001 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 238 transitions. [2018-02-02 10:02:07,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:02:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 238 transitions. [2018-02-02 10:02:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:02:07,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:07,001 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:07,001 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2011206561, now seen corresponding path program 1 times [2018-02-02 10:02:07,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:07,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:07,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:07,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 10:02:07,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:07,625 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:02:07,625 INFO L182 omatonBuilderFactory]: Interpolants [13674#true, 13675#false, 13676#(= 0 |main_#t~malloc0.offset|), 13677#(= main_~root~0.offset 0), 13678#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 13679#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 13680#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 |main_#t~malloc28.offset|) (not (= |main_#t~malloc28.base| main_~root~0.base)) (not (= 0 |main_#t~malloc28.base|)) (= main_~root~0.offset 0)), 13681#(and (not (= main_~root~0.base main_~s~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)))), 13682#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= main_~s~0.offset 0) (not (= 0 main_~s~0.base)) (or (= 0 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))))), 13683#(and (not (= 0 main_~st~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (or (= 0 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 13684#(and (not (= 0 main_~st~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~st~0.offset 0) (or (= 0 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 13685#(and (or (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) (+ 0 4))) (= 0 (select (store |#valid| main_~st~0.base 0) |main_#t~mem32.base|))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4))) (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0)), 13686#(and (or (and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (store |#valid| main_~st~0.base 0) main_~n~0.base))) (not (= 0 main_~st~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 13687#(or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select |#valid| main_~n~0.base))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 13688#(or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)))), 13689#(or (<= 1 main_~n~0.offset) (and (= |main_#t~mem38.base| 0) (= |main_#t~mem38.offset| 0) (= 1 (select |#valid| main_~n~0.base)))), 13690#(<= 1 main_~n~0.offset), 13691#(or (<= 1 main_~n~0.offset) (not (= 1 (select |#valid| main_~n~0.base)))), 13692#(and (<= 1 main_~n~0.offset) (= (select |#valid| main_~n~0.base) 1))] [2018-02-02 10:02:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:07,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:02:07,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:02:07,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:02:07,626 INFO L87 Difference]: Start difference. First operand 209 states and 238 transitions. Second operand 19 states. [2018-02-02 10:02:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:08,755 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2018-02-02 10:02:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:02:08,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-02-02 10:02:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:08,756 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:02:08,756 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 10:02:08,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:02:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 10:02:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2018-02-02 10:02:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 10:02:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2018-02-02 10:02:08,758 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 43 [2018-02-02 10:02:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:08,758 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2018-02-02 10:02:08,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:02:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2018-02-02 10:02:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:02:08,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:08,759 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:08,759 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -334069887, now seen corresponding path program 1 times [2018-02-02 10:02:08,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:08,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:09,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:09,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:02:09,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:09,042 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:02:09,042 INFO L182 omatonBuilderFactory]: Interpolants [14193#true, 14194#false, 14195#(= 0 |main_#t~malloc0.offset|), 14196#(= main_~root~0.offset 0), 14197#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 14198#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 |main_#t~malloc28.offset|) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc28.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 14199#(and (not (= main_~root~0.base main_~s~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 14200#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))) (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))))), 14201#(and (= main_~s~0.offset main_~st~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 14202#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 14203#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) |main_#t~mem32.offset|)) (= main_~st~0.offset 0)), 14204#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 14205#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 1 (select |#valid| main_~n~0.base)))), 14206#(and (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem33.base| 0) (= |main_#t~mem33.offset| 0))] [2018-02-02 10:02:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:09,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:02:09,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:02:09,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:02:09,042 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand 14 states. [2018-02-02 10:02:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:09,605 INFO L93 Difference]: Finished difference Result 215 states and 243 transitions. [2018-02-02 10:02:09,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:02:09,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-02-02 10:02:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:09,606 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:02:09,606 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 10:02:09,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:02:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 10:02:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2018-02-02 10:02:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 10:02:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2018-02-02 10:02:09,608 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 43 [2018-02-02 10:02:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:09,608 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2018-02-02 10:02:09,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:02:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2018-02-02 10:02:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:02:09,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:09,608 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] [2018-02-02 10:02:09,608 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:09,609 INFO L82 PathProgramCache]: Analyzing trace with hash -507539475, now seen corresponding path program 1 times [2018-02-02 10:02:09,609 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:09,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:09,907 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:02:09,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:09,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:02:09,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:09,907 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:02:09,907 INFO L182 omatonBuilderFactory]: Interpolants [14656#(or (not |main_#t~short6|) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 14657#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 14658#(and (= 0 |main_#t~mem8.base|) (= 1 (select |#valid| 0))), 14659#(= (select |#valid| main_~n~0.base) 1), 14641#true, 14642#false, 14643#(= 0 (select |#valid| 0)), 14644#(and (= 0 (select |#valid| 0)) (= (select |#valid| main_~root~0.base) 1)), 14645#(and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~n~0.offset main_~root~0.offset)), 14646#(and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.base|) (= main_~n~0.offset main_~root~0.offset)), 14647#(and (or |main_#t~short6| (and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset))) (= (select |#valid| main_~n~0.base) 1)), 14648#(and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 14649#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 14650#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 14651#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 14652#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (or (= 1 (select |#valid| 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)))), 14653#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 14654#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 14655#(and (= 0 |main_#t~mem4.base|) (or (= |main_#t~mem4.offset| 0) (= 1 (select |#valid| 0))) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.base|))] [2018-02-02 10:02:09,907 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:02:09,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:02:09,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:02:09,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:02:09,908 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand 19 states. [2018-02-02 10:02:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:10,553 INFO L93 Difference]: Finished difference Result 255 states and 293 transitions. [2018-02-02 10:02:10,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:02:10,553 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 10:02:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:10,554 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:02:10,554 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:02:10,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:02:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:02:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 216. [2018-02-02 10:02:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 10:02:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2018-02-02 10:02:10,556 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 48 [2018-02-02 10:02:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:10,557 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2018-02-02 10:02:10,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:02:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2018-02-02 10:02:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:02:10,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:10,557 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] [2018-02-02 10:02:10,558 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash -822481427, now seen corresponding path program 1 times [2018-02-02 10:02:10,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:10,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:02:10,697 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:02:10,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:10,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:02:10,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:10,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:02:10,698 INFO L182 omatonBuilderFactory]: Interpolants [15168#(= 1 (select |#valid| |main_#t~mem8.base|)), 15169#(= 1 (select |#valid| main_~n~0.base)), 15157#true, 15158#false, 15159#(= (select |#valid| main_~root~0.base) 1), 15160#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 15161#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| |main_#t~malloc13.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 15162#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base)), 15163#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|))), 15164#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base)), 15165#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base)), 15166#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 15167#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))] [2018-02-02 10:02:10,698 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:02:10,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:02:10,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:02:10,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:02:10,699 INFO L87 Difference]: Start difference. First operand 216 states and 248 transitions. Second operand 13 states. [2018-02-02 10:02:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:11,115 INFO L93 Difference]: Finished difference Result 428 states and 508 transitions. [2018-02-02 10:02:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:02:11,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 10:02:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:11,116 INFO L225 Difference]: With dead ends: 428 [2018-02-02 10:02:11,116 INFO L226 Difference]: Without dead ends: 428 [2018-02-02 10:02:11,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:02:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-02 10:02:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 261. [2018-02-02 10:02:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:02:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2018-02-02 10:02:11,119 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 48 [2018-02-02 10:02:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:11,119 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2018-02-02 10:02:11,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:02:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2018-02-02 10:02:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:02:11,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:11,120 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] [2018-02-02 10:02:11,120 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash -822481426, now seen corresponding path program 1 times [2018-02-02 10:02:11,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:11,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:11,282 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:02:11,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:11,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:02:11,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:11,283 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:02:11,283 INFO L182 omatonBuilderFactory]: Interpolants [15881#true, 15882#false, 15883#(= (select |#valid| main_~root~0.base) 1), 15884#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 15885#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 15886#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 15887#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 15888#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 15889#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 15890#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 15891#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 15892#(and (= 0 |main_#t~mem8.offset|) (= 8 (select |#length| |main_#t~mem8.base|))), 15893#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:02:11,283 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:02:11,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:02:11,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:02:11,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:02:11,284 INFO L87 Difference]: Start difference. First operand 261 states and 316 transitions. Second operand 13 states. [2018-02-02 10:02:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:11,820 INFO L93 Difference]: Finished difference Result 476 states and 567 transitions. [2018-02-02 10:02:11,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:02:11,820 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 10:02:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:11,821 INFO L225 Difference]: With dead ends: 476 [2018-02-02 10:02:11,821 INFO L226 Difference]: Without dead ends: 476 [2018-02-02 10:02:11,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:02:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-02 10:02:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 281. [2018-02-02 10:02:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 10:02:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 340 transitions. [2018-02-02 10:02:11,824 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 340 transitions. Word has length 48 [2018-02-02 10:02:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:11,824 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 340 transitions. [2018-02-02 10:02:11,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:02:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 340 transitions. [2018-02-02 10:02:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:02:11,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:11,825 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] [2018-02-02 10:02:11,825 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash -816755789, now seen corresponding path program 1 times [2018-02-02 10:02:11,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:11,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:02:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:12,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:12,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:02:12,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:12,015 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:02:12,015 INFO L182 omatonBuilderFactory]: Interpolants [16673#true, 16674#false, 16675#(= 0 |main_#t~malloc0.offset|), 16676#(= main_~root~0.offset 0), 16677#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 16678#(and (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 16679#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)) (not |main_#t~short21|)), 16680#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 16681#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 16682#(and (= main_~n~0.offset 0) (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)), 16683#(and (= main_~n~0.offset 0) (not |main_#t~short6|))] [2018-02-02 10:02:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:12,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:02:12,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:02:12,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:02:12,016 INFO L87 Difference]: Start difference. First operand 281 states and 340 transitions. Second operand 11 states. [2018-02-02 10:02:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:12,381 INFO L93 Difference]: Finished difference Result 385 states and 471 transitions. [2018-02-02 10:02:12,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:02:12,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 10:02:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:12,383 INFO L225 Difference]: With dead ends: 385 [2018-02-02 10:02:12,383 INFO L226 Difference]: Without dead ends: 385 [2018-02-02 10:02:12,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:02:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-02 10:02:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 329. [2018-02-02 10:02:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-02 10:02:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 401 transitions. [2018-02-02 10:02:12,386 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 401 transitions. Word has length 48 [2018-02-02 10:02:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:12,386 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 401 transitions. [2018-02-02 10:02:12,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:02:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 401 transitions. [2018-02-02 10:02:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:02:12,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:12,387 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:12,387 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash 234285945, now seen corresponding path program 1 times [2018-02-02 10:02:12,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:12,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:12,641 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:02:12,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:12,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:02:12,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:12,642 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:02:12,642 INFO L182 omatonBuilderFactory]: Interpolants [17422#true, 17423#false, 17424#(= (select |#valid| main_~root~0.base) 1), 17425#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 17426#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 17427#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= main_~n~0.offset main_~root~0.offset)), 17428#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 17429#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 17430#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 17431#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~n~0.offset main_~root~0.offset)), 17432#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 17433#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem24.base|)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 17434#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 17435#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 17436#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 17437#(= 1 (select |#valid| |main_#t~mem8.base|)), 17438#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 10:02:12,642 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:02:12,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:02:12,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:02:12,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:02:12,643 INFO L87 Difference]: Start difference. First operand 329 states and 401 transitions. Second operand 17 states. [2018-02-02 10:02:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:13,503 INFO L93 Difference]: Finished difference Result 849 states and 1053 transitions. [2018-02-02 10:02:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:02:13,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:02:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:13,505 INFO L225 Difference]: With dead ends: 849 [2018-02-02 10:02:13,505 INFO L226 Difference]: Without dead ends: 849 [2018-02-02 10:02:13,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=566, Invalid=1504, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:02:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-02-02 10:02:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 401. [2018-02-02 10:02:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-02 10:02:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 503 transitions. [2018-02-02 10:02:13,509 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 503 transitions. Word has length 56 [2018-02-02 10:02:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:13,509 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 503 transitions. [2018-02-02 10:02:13,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:02:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 503 transitions. [2018-02-02 10:02:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:02:13,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:13,510 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:13,510 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash 234285946, now seen corresponding path program 1 times [2018-02-02 10:02:13,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:13,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:13,793 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:02:13,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:13,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:02:13,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:13,794 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:02:13,794 INFO L182 omatonBuilderFactory]: Interpolants [18752#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 18753#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 8 (select |#length| |main_#t~mem15.base|)) (= main_~n~0.offset main_~root~0.offset)), 18754#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 18755#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 18756#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 18757#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 18758#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset)), 18759#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 18760#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 18761#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 18762#(and (= 0 |main_#t~mem8.offset|) (= 8 (select |#length| |main_#t~mem8.base|))), 18763#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 18747#true, 18748#false, 18749#(= (select |#valid| main_~root~0.base) 1), 18750#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 18751#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|))] [2018-02-02 10:02:13,794 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:02:13,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:02:13,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:02:13,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:02:13,795 INFO L87 Difference]: Start difference. First operand 401 states and 503 transitions. Second operand 17 states. [2018-02-02 10:02:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:15,234 INFO L93 Difference]: Finished difference Result 902 states and 1118 transitions. [2018-02-02 10:02:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:02:15,234 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:02:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:15,236 INFO L225 Difference]: With dead ends: 902 [2018-02-02 10:02:15,236 INFO L226 Difference]: Without dead ends: 902 [2018-02-02 10:02:15,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=497, Invalid=1665, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:02:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-02-02 10:02:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 356. [2018-02-02 10:02:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-02 10:02:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 435 transitions. [2018-02-02 10:02:15,240 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 435 transitions. Word has length 56 [2018-02-02 10:02:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:15,240 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 435 transitions. [2018-02-02 10:02:15,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:02:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 435 transitions. [2018-02-02 10:02:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:02:15,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:15,241 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:15,241 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:15,241 INFO L82 PathProgramCache]: Analyzing trace with hash 240011583, now seen corresponding path program 1 times [2018-02-02 10:02:15,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:15,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:15,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:15,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:02:15,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:15,437 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:02:15,438 INFO L182 omatonBuilderFactory]: Interpolants [20082#true, 20083#false, 20084#(= 0 |main_#t~malloc0.offset|), 20085#(= main_~root~0.offset 0), 20086#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 20087#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 20088#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 20089#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 20090#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 20091#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 20092#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 20093#(and (= main_~n~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 20094#(= 1 (select |#valid| |main_#t~mem9.base|)), 20095#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:02:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:15,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:02:15,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:02:15,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:02:15,438 INFO L87 Difference]: Start difference. First operand 356 states and 435 transitions. Second operand 14 states. [2018-02-02 10:02:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:15,889 INFO L93 Difference]: Finished difference Result 829 states and 1042 transitions. [2018-02-02 10:02:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:02:15,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 10:02:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:15,891 INFO L225 Difference]: With dead ends: 829 [2018-02-02 10:02:15,891 INFO L226 Difference]: Without dead ends: 829 [2018-02-02 10:02:15,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=601, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:02:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-02-02 10:02:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 475. [2018-02-02 10:02:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-02-02 10:02:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 608 transitions. [2018-02-02 10:02:15,895 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 608 transitions. Word has length 56 [2018-02-02 10:02:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:15,895 INFO L432 AbstractCegarLoop]: Abstraction has 475 states and 608 transitions. [2018-02-02 10:02:15,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:02:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 608 transitions. [2018-02-02 10:02:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:02:15,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:15,896 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:15,896 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 240011584, now seen corresponding path program 1 times [2018-02-02 10:02:15,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:15,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:16,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:16,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:02:16,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:16,062 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:02:16,062 INFO L182 omatonBuilderFactory]: Interpolants [21440#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 21441#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 21442#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 21443#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0)), 21444#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 21445#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 21432#true, 21433#false, 21434#(= 0 |main_#t~malloc0.offset|), 21435#(= main_~root~0.offset 0), 21436#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 21437#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 21438#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 21439#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))] [2018-02-02 10:02:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:16,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:02:16,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:02:16,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:02:16,063 INFO L87 Difference]: Start difference. First operand 475 states and 608 transitions. Second operand 14 states. [2018-02-02 10:02:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:16,714 INFO L93 Difference]: Finished difference Result 899 states and 1130 transitions. [2018-02-02 10:02:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:02:16,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 10:02:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:16,716 INFO L225 Difference]: With dead ends: 899 [2018-02-02 10:02:16,716 INFO L226 Difference]: Without dead ends: 899 [2018-02-02 10:02:16,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:02:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-02-02 10:02:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 489. [2018-02-02 10:02:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-02-02 10:02:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 627 transitions. [2018-02-02 10:02:16,721 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 627 transitions. Word has length 56 [2018-02-02 10:02:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:16,721 INFO L432 AbstractCegarLoop]: Abstraction has 489 states and 627 transitions. [2018-02-02 10:02:16,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:02:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 627 transitions. [2018-02-02 10:02:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:02:16,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:16,722 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:16,722 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash 276934091, now seen corresponding path program 1 times [2018-02-02 10:02:16,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:16,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:17,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:17,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 10:02:17,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:17,091 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:02:17,091 INFO L182 omatonBuilderFactory]: Interpolants [22880#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)) 0)) (= main_~s~0.offset 0)), 22881#(and (= main_~s~0.offset main_~st~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)) 0)) (= main_~st~0.offset 0)), 22882#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)) 0)) (= main_~st~0.offset 0)), 22883#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4)) 0)) (= main_~st~0.offset 0)), 22884#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 22885#(or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (not (= 1 (select |#valid| main_~n~0.base)))), 22886#(and (= (select |#valid| main_~n~0.base) 1) (or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (<= 1 main_~n~0.offset))), 22887#(and (or (<= 1 main_~n~0.offset) (not (= |main_#t~mem38.base| 0))) (= (select |#valid| main_~n~0.base) 1)), 22888#(and (<= 1 main_~n~0.offset) (= (select |#valid| main_~n~0.base) 1)), 22866#true, 22867#false, 22868#(= 0 |main_#t~malloc0.offset|), 22869#(= main_~root~0.offset 0), 22870#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 22871#(and (= main_~n~0.offset 0) (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 22872#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= |main_#t~malloc22.base| 0)) (not (= |main_#t~malloc22.base| main_~n~0.base)) (= main_~root~0.offset 0)), 22873#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~n~0.base))), 22874#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~n~0.base))), 22875#(and (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 22876#(and (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 22877#(and (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= 0 |main_#t~malloc28.offset|) (not (= |main_#t~malloc28.base| main_~root~0.base)) (= main_~root~0.offset 0)), 22878#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base))), 22879#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0))] [2018-02-02 10:02:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:17,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:02:17,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:02:17,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:02:17,091 INFO L87 Difference]: Start difference. First operand 489 states and 627 transitions. Second operand 23 states. [2018-02-02 10:02:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:17,998 INFO L93 Difference]: Finished difference Result 855 states and 1075 transitions. [2018-02-02 10:02:17,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:02:17,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 10:02:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:18,000 INFO L225 Difference]: With dead ends: 855 [2018-02-02 10:02:18,001 INFO L226 Difference]: Without dead ends: 854 [2018-02-02 10:02:18,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=1850, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:02:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-02-02 10:02:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 573. [2018-02-02 10:02:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-02-02 10:02:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 734 transitions. [2018-02-02 10:02:18,007 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 734 transitions. Word has length 57 [2018-02-02 10:02:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:18,007 INFO L432 AbstractCegarLoop]: Abstraction has 573 states and 734 transitions. [2018-02-02 10:02:18,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:02:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 734 transitions. [2018-02-02 10:02:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:02:18,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:18,008 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:18,008 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1544622027, now seen corresponding path program 1 times [2018-02-02 10:02:18,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:18,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:18,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:18,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 10:02:18,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:18,371 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:02:18,371 INFO L182 omatonBuilderFactory]: Interpolants [24384#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 0))) (= main_~st~0.offset 0)), 24385#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) 0))) (= main_~st~0.offset 0)), 24386#(and (or (not (= 0 main_~n~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))) (= main_~st~0.offset 0)), 24387#(or (not (= 0 main_~n~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 1 (select |#valid| main_~n~0.base)))), 24388#(and (= (select |#valid| main_~n~0.base) 1) (or (not (= 0 main_~n~0.offset)) (not (= 0 |main_#t~mem33.base|)))), 24389#(and (not (= 0 main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1)), 24367#true, 24368#false, 24369#(= 0 |main_#t~malloc0.offset|), 24370#(= main_~root~0.offset 0), 24371#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 24372#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0)), 24373#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= main_~root~0.offset 0) (not (= main_~n~0.base |main_#t~malloc13.base|)) (not (= 0 |main_#t~malloc13.base|))), 24374#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) 0))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0)), 24375#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) 0))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= main_~root~0.offset 0)), 24376#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) 0))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 24377#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) 0))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 24378#(and (= 1 (select |#valid| main_~root~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) 0))) (= main_~root~0.offset 0)), 24379#(and (= 0 |main_#t~malloc28.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) 0))) (not (= |main_#t~malloc28.base| main_~root~0.base)) (= main_~root~0.offset 0)), 24380#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) 0))) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 24381#(and (= main_~s~0.offset 0) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) 0))) (= main_~root~0.offset 0)), 24382#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) 0))) (= main_~s~0.offset 0)), 24383#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 0))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0))] [2018-02-02 10:02:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:18,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:02:18,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:02:18,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:02:18,371 INFO L87 Difference]: Start difference. First operand 573 states and 734 transitions. Second operand 23 states. [2018-02-02 10:02:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:19,222 INFO L93 Difference]: Finished difference Result 863 states and 1079 transitions. [2018-02-02 10:02:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:02:19,222 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 10:02:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:19,224 INFO L225 Difference]: With dead ends: 863 [2018-02-02 10:02:19,224 INFO L226 Difference]: Without dead ends: 853 [2018-02-02 10:02:19,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=415, Invalid=1937, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:02:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-02-02 10:02:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 619. [2018-02-02 10:02:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-02-02 10:02:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 790 transitions. [2018-02-02 10:02:19,230 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 790 transitions. Word has length 57 [2018-02-02 10:02:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:19,230 INFO L432 AbstractCegarLoop]: Abstraction has 619 states and 790 transitions. [2018-02-02 10:02:19,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:02:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 790 transitions. [2018-02-02 10:02:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:02:19,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:19,231 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:02:19,231 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash 437515815, now seen corresponding path program 2 times [2018-02-02 10:02:19,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:19,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:19,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:19,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:02:19,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:19,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:02:19,855 INFO L182 omatonBuilderFactory]: Interpolants [25924#true, 25925#false, 25926#(= 0 |main_#t~malloc0.offset|), 25927#(= 0 main_~root~0.offset), 25928#(and (= 0 main_~root~0.offset) (= (select |#valid| main_~root~0.base) 1)), 25929#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 25930#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 25931#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 25932#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= |main_#t~mem15.offset| 0)), 25933#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 25934#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) 0)) (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) 0))), 25935#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) 0)) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset) |main_#t~malloc22.base|)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) 0)) (= 0 |main_#t~malloc22.offset|)), 25936#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 25937#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem24.base| (store (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem24.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 25938#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 25939#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 0))), 25940#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 25941#(and (= |main_#t~mem4.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.offset|) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 25942#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))), 25943#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) |main_#t~mem8.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) |main_#t~mem8.offset|))), 25944#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 25945#(and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)), 25946#(not |main_#t~short6|)] [2018-02-02 10:02:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:19,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:02:19,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:02:19,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:02:19,856 INFO L87 Difference]: Start difference. First operand 619 states and 790 transitions. Second operand 23 states. [2018-02-02 10:02:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:21,465 INFO L93 Difference]: Finished difference Result 1092 states and 1382 transitions. [2018-02-02 10:02:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:02:21,465 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-02-02 10:02:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:21,467 INFO L225 Difference]: With dead ends: 1092 [2018-02-02 10:02:21,467 INFO L226 Difference]: Without dead ends: 1092 [2018-02-02 10:02:21,467 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=641, Invalid=2551, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:02:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2018-02-02 10:02:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 725. [2018-02-02 10:02:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-02-02 10:02:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 935 transitions. [2018-02-02 10:02:21,473 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 935 transitions. Word has length 66 [2018-02-02 10:02:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:21,473 INFO L432 AbstractCegarLoop]: Abstraction has 725 states and 935 transitions. [2018-02-02 10:02:21,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:02:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 935 transitions. [2018-02-02 10:02:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:02:21,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:21,474 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-02-02 10:02:21,474 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash 394089581, now seen corresponding path program 1 times [2018-02-02 10:02:21,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:21,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:21,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:21,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:02:21,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:21,905 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:02:21,906 INFO L182 omatonBuilderFactory]: Interpolants [27840#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= |main_#t~mem26.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))), 27841#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0))), 27842#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0))), 27843#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 27844#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))))))), 27845#(and (= 8 (select |#length| |main_#t~mem9.base|)) (or (not (= |main_#t~mem9.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem9.base|) |main_#t~mem9.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem9.base|) |main_#t~mem9.offset|))))), 27846#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.offset 0))) (= (select |#length| main_~n~0.base) 8)), 27847#(and (= (select |#length| main_~n~0.base) 8) (<= 0 main_~n~0.offset) (or (not (= main_~n~0.offset 0)) (and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)))), 27848#(and (or (not |main_#t~short6|) (not (= main_~n~0.offset 0))) (= (select |#length| main_~n~0.base) 8) (<= 0 main_~n~0.offset)), 27849#(and (not (= main_~n~0.offset 0)) (= (select |#length| main_~n~0.base) 8) (<= 0 main_~n~0.offset)), 27832#true, 27833#false, 27834#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset)), 27835#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset)), 27836#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= 0 |main_#t~malloc22.offset|)), 27837#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 27838#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.offset| 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|))), 27839#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))] [2018-02-02 10:02:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:21,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:02:21,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:02:21,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:02:21,906 INFO L87 Difference]: Start difference. First operand 725 states and 935 transitions. Second operand 18 states. [2018-02-02 10:02:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:22,874 INFO L93 Difference]: Finished difference Result 1043 states and 1313 transitions. [2018-02-02 10:02:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:02:22,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-02 10:02:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:22,876 INFO L225 Difference]: With dead ends: 1043 [2018-02-02 10:02:22,876 INFO L226 Difference]: Without dead ends: 1040 [2018-02-02 10:02:22,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:02:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-02-02 10:02:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 693. [2018-02-02 10:02:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-02-02 10:02:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 883 transitions. [2018-02-02 10:02:22,883 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 883 transitions. Word has length 66 [2018-02-02 10:02:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:22,883 INFO L432 AbstractCegarLoop]: Abstraction has 693 states and 883 transitions. [2018-02-02 10:02:22,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:02:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 883 transitions. [2018-02-02 10:02:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:02:22,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:22,884 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] [2018-02-02 10:02:22,884 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1388862468, now seen corresponding path program 1 times [2018-02-02 10:02:22,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:22,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:23,408 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 31 DAG size of output 27 [2018-02-02 10:02:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:24,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:24,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:02:24,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:24,106 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:02:24,107 INFO L182 omatonBuilderFactory]: Interpolants [29632#(and (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 29633#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= 0 (select |#valid| 0)) (not (= |main_#t~malloc22.base| main_~n~0.base)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 29634#(and (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~n~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 29635#(and (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 29636#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))))), 29637#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 29638#(and (= 0 (select |#valid| 0)) (= 0 |main_#t~malloc28.offset|) (not (= 0 |main_#t~malloc28.base|)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select (store |#valid| |main_#t~malloc28.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc28.base|))), 29639#(and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select |#valid| 0)) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base))), 29640#(and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0)), 29641#(and (not (= 0 main_~st~0.base)) (= main_~s~0.offset main_~st~0.offset) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 29642#(and (not (= 0 main_~st~0.base)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 29643#(and (not (= 0 main_~st~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4)))) (= |main_#t~mem32.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4))))), 29644#(and (not (= 0 main_~st~0.base)) (or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select |#valid| 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (= main_~st~0.offset 0)), 29645#(or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (not (= 1 (select |#valid| main_~n~0.base)))), 29646#(and (= (select |#valid| main_~n~0.base) 1) (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))))), 29647#(and (not (= main_~n~0.base |main_#t~malloc39.base|)) (or (and (not (= main_~n~0.base 0)) (not (= |main_#t~malloc39.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= 0 |main_#t~malloc39.base|))) (<= 1 main_~n~0.offset)) (= 0 |main_#t~malloc39.offset|)), 29648#(and (or (<= 1 main_~n~0.offset) (and (not (= main_~st~0.base (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base 0)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= 0 main_~st~0.base)))) (= main_~st~0.offset 0)), 29649#(and (= main_~st~0.offset 0) (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~st~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= 0 main_~st~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))))), 29650#(and (= main_~st~0.offset 0) (or (<= 1 main_~n~0.offset) (and (not (= main_~st~0.base |main_#t~mem42.base|)) (not (= main_~n~0.base 0)) (not (= 0 main_~st~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) |main_#t~mem42.base|))))), 29651#(and (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= 0 main_~st~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (not (= main_~st~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))))) (= main_~st~0.offset 0)), 29652#(and (= 0 main_~s~0.offset) (or (and (not (= main_~n~0.base 0)) (not (= 0 main_~s~0.base)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (<= 1 main_~n~0.offset))), 29653#(and (= 0 main_~s~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= 0 main_~s~0.base)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 29654#(and (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 29655#(and (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem32.base|))), 29656#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0)), 29657#(= (select |#valid| main_~n~0.base) 1), 29626#true, 29627#false, 29628#(= 0 (select |#valid| 0)), 29629#(and (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 29630#(and (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 29631#(and (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0))] [2018-02-02 10:02:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:24,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:02:24,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:02:24,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:02:24,108 INFO L87 Difference]: Start difference. First operand 693 states and 883 transitions. Second operand 32 states. [2018-02-02 10:02:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:26,878 INFO L93 Difference]: Finished difference Result 1019 states and 1279 transitions. [2018-02-02 10:02:26,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:02:26,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 67 [2018-02-02 10:02:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:26,880 INFO L225 Difference]: With dead ends: 1019 [2018-02-02 10:02:26,880 INFO L226 Difference]: Without dead ends: 1019 [2018-02-02 10:02:26,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=701, Invalid=4129, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:02:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-02-02 10:02:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 708. [2018-02-02 10:02:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-02-02 10:02:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 899 transitions. [2018-02-02 10:02:26,886 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 899 transitions. Word has length 67 [2018-02-02 10:02:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:26,886 INFO L432 AbstractCegarLoop]: Abstraction has 708 states and 899 transitions. [2018-02-02 10:02:26,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:02:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 899 transitions. [2018-02-02 10:02:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:02:26,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:26,887 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] [2018-02-02 10:02:26,887 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1388862467, now seen corresponding path program 1 times [2018-02-02 10:02:26,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:26,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:28,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:28,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:02:28,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:28,126 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:02:28,126 INFO L182 omatonBuilderFactory]: Interpolants [31488#(or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base main_~st~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ 0 4))) (= main_~st~0.offset 0))), 31489#(or (and (= 0 main_~s~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))) (<= 1 main_~n~0.offset)), 31490#(and (= 0 main_~s~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))), 31491#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 31492#(and (= 0 |main_#t~mem32.offset|) (= 8 (select |#length| |main_#t~mem32.base|)) (= main_~st~0.offset 0)), 31493#(and (= main_~n~0.offset 0) (= main_~st~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 31494#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 31461#true, 31462#false, 31463#(= 0 |main_#t~malloc0.offset|), 31464#(= main_~root~0.offset 0), 31465#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 31466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 31467#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset))), 31468#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) (+ main_~root~0.offset 4))) (or (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset 0) (or (= 8 (select |#length| |main_#t~malloc22.base|)) (not (= main_~root~0.offset main_~n~0.offset)))), 31469#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (not (= main_~root~0.offset main_~n~0.offset)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 31470#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (not (= main_~root~0.offset main_~n~0.offset)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 31471#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (or (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))))), 31472#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| main_~root~0.base)) (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))))) (= main_~root~0.offset 0)), 31473#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))))) (= 0 |main_#t~malloc28.offset|) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc28.base|))), 31474#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (or (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (not (= main_~s~0.base main_~root~0.base))), 31475#(and (or (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) (+ main_~root~0.offset 4)))), 31476#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= main_~s~0.offset 0)), 31477#(and (= main_~s~0.offset main_~st~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 31478#(and (or (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 31479#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) (+ 0 4))) (or (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4))))) (= main_~st~0.offset 0)), 31480#(or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~st~0.offset 0))), 31481#(or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (not (= 1 (select |#valid| main_~n~0.base)))), 31482#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (<= 1 main_~n~0.offset)), 31483#(or (<= 1 main_~n~0.offset) (and (= |main_#t~mem38.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem38.offset| 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= |main_#t~mem38.base| 0)))), 31484#(or (<= 1 main_~n~0.offset) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| main_~n~0.base) 1))), 31485#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)) (<= 1 main_~n~0.offset)), 31486#(or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))))), 31487#(or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base main_~st~0.base)) (= 0 |main_#t~mem42.offset|) (= 8 (select |#length| |main_#t~mem42.base|)) (= main_~st~0.offset 0)))] [2018-02-02 10:02:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:28,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:02:28,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:02:28,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:02:28,127 INFO L87 Difference]: Start difference. First operand 708 states and 899 transitions. Second operand 34 states. [2018-02-02 10:02:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:31,361 INFO L93 Difference]: Finished difference Result 992 states and 1230 transitions. [2018-02-02 10:02:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:02:31,361 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-02-02 10:02:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:31,363 INFO L225 Difference]: With dead ends: 992 [2018-02-02 10:02:31,363 INFO L226 Difference]: Without dead ends: 992 [2018-02-02 10:02:31,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=688, Invalid=5012, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:02:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-02-02 10:02:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 845. [2018-02-02 10:02:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-02-02 10:02:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1071 transitions. [2018-02-02 10:02:31,369 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1071 transitions. Word has length 67 [2018-02-02 10:02:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:31,369 INFO L432 AbstractCegarLoop]: Abstraction has 845 states and 1071 transitions. [2018-02-02 10:02:31,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:02:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1071 transitions. [2018-02-02 10:02:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:02:31,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:31,370 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] [2018-02-02 10:02:31,370 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash 560828380, now seen corresponding path program 1 times [2018-02-02 10:02:31,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:31,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:32,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:32,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 10:02:32,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:32,024 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:02:32,024 INFO L182 omatonBuilderFactory]: Interpolants [33416#true, 33417#false, 33418#(= 0 |main_#t~malloc0.offset|), 33419#(= main_~root~0.offset 0), 33420#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 33421#(and (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 33422#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.base main_~n~0.base) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 33423#(or |main_#t~short6| (and (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset))), 33424#(and (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33425#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33426#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 33427#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 33428#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 33429#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 33430#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 |main_#t~malloc28.offset|) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc28.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 33431#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base))), 33432#(and (= main_~s~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0)), 33433#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))) (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))))), 33434#(and (= main_~s~0.offset main_~st~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 33435#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 33436#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) |main_#t~mem32.offset|)) (= main_~st~0.offset 0)), 33437#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 33438#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 33439#(and (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem33.base| 0) (= |main_#t~mem33.offset| 0)), 33440#(and (not (= main_~n~0.base |main_#t~malloc34.base|)) (not (= 1 (select |#valid| main_~n~0.base)))), 33441#(not (= 1 (select |#valid| main_~n~0.base)))] [2018-02-02 10:02:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:32,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:02:32,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:02:32,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:02:32,025 INFO L87 Difference]: Start difference. First operand 845 states and 1071 transitions. Second operand 26 states. [2018-02-02 10:02:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:33,053 INFO L93 Difference]: Finished difference Result 993 states and 1234 transitions. [2018-02-02 10:02:33,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:02:33,054 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2018-02-02 10:02:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:33,056 INFO L225 Difference]: With dead ends: 993 [2018-02-02 10:02:33,056 INFO L226 Difference]: Without dead ends: 979 [2018-02-02 10:02:33,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:02:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-02-02 10:02:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 871. [2018-02-02 10:02:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-02-02 10:02:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1091 transitions. [2018-02-02 10:02:33,061 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1091 transitions. Word has length 67 [2018-02-02 10:02:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:33,061 INFO L432 AbstractCegarLoop]: Abstraction has 871 states and 1091 transitions. [2018-02-02 10:02:33,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:02:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1091 transitions. [2018-02-02 10:02:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:02:33,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:33,062 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] [2018-02-02 10:02:33,062 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash 313160156, now seen corresponding path program 1 times [2018-02-02 10:02:33,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:33,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:33,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:33,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:02:33,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:33,829 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:02:33,830 INFO L182 omatonBuilderFactory]: Interpolants [35358#true, 35359#false, 35360#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 35361#(and (not (= 0 main_~root~0.base)) (= main_~root~0.offset 0)), 35362#(and (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 35363#(and (= main_~n~0.base main_~root~0.base) (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 35364#(and (= main_~n~0.base main_~root~0.base) (not (= 0 main_~root~0.base)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 35365#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= 0 main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 35366#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= 0 main_~root~0.base)) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 35367#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= 0 main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 35368#(and (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 35369#(and (not (= 0 main_~root~0.base)) (= 0 |main_#t~malloc28.offset|) (not (= 0 |main_#t~malloc28.base|)) (= main_~root~0.offset 0) (= 1 (select (store |#valid| |main_#t~malloc28.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (not (= main_~root~0.base |main_#t~malloc28.base|)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 35370#(and (not (= 0 main_~root~0.base)) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base)) (= (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) 1) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)))), 35371#(and (not (= 0 main_~root~0.base)) (not (= 0 main_~s~0.base)) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset))) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)))), 35372#(and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))))) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))))), 35373#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (not (= 0 main_~st~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 35374#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (not (= 0 main_~st~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 35375#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|))) (not (= 0 |main_#t~mem32.base|)) (not (= 0 main_~st~0.base)) (= |main_#t~mem32.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (= (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|)) 1) (= main_~st~0.offset 0)), 35376#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0) (= (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1)), 35377#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 35378#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 35379#(and (not (= 0 main_~n~0.base)) (not (= main_~n~0.base |main_#t~malloc34.base|)) (= 0 |main_#t~malloc34.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~malloc34.base|)) (not (= 0 |main_#t~malloc34.base|)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 35380#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset) main_~st~0.base)) (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset)))), 35381#(and (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base)) (not (= |main_#t~mem37.base| main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~n~0.base 0) |main_#t~mem37.base|))), 35382#(and (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 35383#(and (not (= 0 main_~n~0.base)) (= 0 main_~s~0.offset) (not (= 0 main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 35384#(and (= 0 main_~s~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= 0 main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base))), 35385#(and (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 35386#(and (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem32.base|))), 35387#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0)), 35388#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 10:02:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:33,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:02:33,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:02:33,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:02:33,830 INFO L87 Difference]: Start difference. First operand 871 states and 1091 transitions. Second operand 31 states. [2018-02-02 10:02:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:36,053 INFO L93 Difference]: Finished difference Result 1211 states and 1502 transitions. [2018-02-02 10:02:36,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:02:36,054 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2018-02-02 10:02:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:36,056 INFO L225 Difference]: With dead ends: 1211 [2018-02-02 10:02:36,056 INFO L226 Difference]: Without dead ends: 1211 [2018-02-02 10:02:36,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=543, Invalid=3239, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:02:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-02-02 10:02:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 879. [2018-02-02 10:02:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-02-02 10:02:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1100 transitions. [2018-02-02 10:02:36,063 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1100 transitions. Word has length 67 [2018-02-02 10:02:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:36,063 INFO L432 AbstractCegarLoop]: Abstraction has 879 states and 1100 transitions. [2018-02-02 10:02:36,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:02:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1100 transitions. [2018-02-02 10:02:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:02:36,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:36,064 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] [2018-02-02 10:02:36,064 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 313160157, now seen corresponding path program 1 times [2018-02-02 10:02:36,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:36,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:36,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:36,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:02:36,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:36,928 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:02:36,928 INFO L182 omatonBuilderFactory]: Interpolants [37568#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 37569#(and (= 0 |main_#t~mem32.offset|) (= 8 (select |#length| |main_#t~mem32.base|)) (= main_~st~0.offset 0)), 37570#(and (= main_~n~0.offset 0) (= main_~st~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 37571#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 37541#true, 37542#false, 37543#(= 0 |main_#t~malloc0.offset|), 37544#(= main_~root~0.offset 0), 37545#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 37546#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 37547#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 37548#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 37549#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 8 (select |#length| |main_#t~mem15.base|)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 37550#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 37551#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 37552#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 37553#(and (= (select (store |#valid| |main_#t~malloc28.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 |main_#t~malloc28.offset|) (not (= 0 |main_#t~malloc28.base|)) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc28.base|))), 37554#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset))) (not (= 0 main_~s~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base)) (= (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) 1)), 37555#(and (= (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)) 1) (not (= 0 main_~s~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)))), 37556#(and (= (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))) 1) (not (= 0 main_~s~0.base)) (= main_~s~0.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))))), 37557#(and (not (= 0 main_~st~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (= main_~s~0.offset main_~st~0.offset) (= (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) 1) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))), 37558#(and (not (= 0 main_~st~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (= (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) 1) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))), 37559#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) |main_#t~mem32.offset|)) (not (= 0 main_~st~0.base)) (= (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) |main_#t~mem32.offset|)) 1) (= main_~st~0.offset 0)), 37560#(and (not (= 0 main_~st~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0) (= (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1)), 37561#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 37562#(and (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 37563#(and (not (= main_~n~0.base |main_#t~malloc34.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 |main_#t~malloc34.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 37564#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~st~0.base (store (select |#memory_$Pointer$.offset| main_~st~0.base) main_~st~0.offset main_~s~0.offset)) main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset)))), 37565#(and (= 0 |main_#t~mem37.offset|) (not (= main_~n~0.base main_~st~0.base)) (= 8 (select |#length| |main_#t~mem37.base|)) (= main_~st~0.offset 0)), 37566#(and (not (= main_~n~0.base main_~st~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ 0 4))) (= main_~st~0.offset 0)), 37567#(and (= 0 main_~s~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))))] [2018-02-02 10:02:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:36,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:02:36,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:02:36,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:02:36,929 INFO L87 Difference]: Start difference. First operand 879 states and 1100 transitions. Second operand 31 states. [2018-02-02 10:02:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:39,228 INFO L93 Difference]: Finished difference Result 1242 states and 1534 transitions. [2018-02-02 10:02:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:02:39,228 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2018-02-02 10:02:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:39,231 INFO L225 Difference]: With dead ends: 1242 [2018-02-02 10:02:39,231 INFO L226 Difference]: Without dead ends: 1242 [2018-02-02 10:02:39,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=472, Invalid=3310, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:02:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2018-02-02 10:02:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 879. [2018-02-02 10:02:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-02-02 10:02:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1100 transitions. [2018-02-02 10:02:39,237 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1100 transitions. Word has length 67 [2018-02-02 10:02:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:39,238 INFO L432 AbstractCegarLoop]: Abstraction has 879 states and 1100 transitions. [2018-02-02 10:02:39,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:02:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1100 transitions. [2018-02-02 10:02:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:02:39,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:39,239 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-02-02 10:02:39,239 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:39,239 INFO L82 PathProgramCache]: Analyzing trace with hash -494864326, now seen corresponding path program 1 times [2018-02-02 10:02:39,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:39,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:39,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:39,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:02:39,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:39,717 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:02:39,717 INFO L182 omatonBuilderFactory]: Interpolants [39755#true, 39756#false, 39757#(= 0 |main_#t~malloc0.offset|), 39758#(= 0 main_~root~0.offset), 39759#(and (= 0 main_~root~0.offset) (= (select |#valid| main_~root~0.base) 1)), 39760#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset)), 39761#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset)), 39762#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 39763#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 39764#(and (= 0 main_~root~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~root~0.base))), 39765#(and (= 0 main_~root~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~root~0.base))), 39766#(and (not (= main_~n~0.offset (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~n~0.base))), 39767#(and (not (= |main_#t~malloc13.base| main_~n~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base)), 39768#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) main_~n~0.base))), 39769#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 39770#(or (and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= 1 (select |#valid| |main_#t~mem17.base|)))), 39771#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 39772#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))), 39773#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 39774#(= 1 (select |#valid| |main_#t~mem9.base|)), 39775#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 10:02:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:39,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:02:39,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:02:39,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:02:39,717 INFO L87 Difference]: Start difference. First operand 879 states and 1100 transitions. Second operand 21 states. [2018-02-02 10:02:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:41,041 INFO L93 Difference]: Finished difference Result 1691 states and 2130 transitions. [2018-02-02 10:02:41,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:02:41,042 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-02-02 10:02:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:41,044 INFO L225 Difference]: With dead ends: 1691 [2018-02-02 10:02:41,044 INFO L226 Difference]: Without dead ends: 1691 [2018-02-02 10:02:41,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:02:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2018-02-02 10:02:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 984. [2018-02-02 10:02:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-02-02 10:02:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1245 transitions. [2018-02-02 10:02:41,053 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1245 transitions. Word has length 72 [2018-02-02 10:02:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:41,053 INFO L432 AbstractCegarLoop]: Abstraction has 984 states and 1245 transitions. [2018-02-02 10:02:41,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:02:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1245 transitions. [2018-02-02 10:02:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:02:41,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:41,054 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-02-02 10:02:41,054 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash -494864325, now seen corresponding path program 1 times [2018-02-02 10:02:41,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:41,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:41,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:02:41,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:02:41,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:41,898 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:02:41,898 INFO L182 omatonBuilderFactory]: Interpolants [42519#true, 42520#false, 42521#(= 0 |main_#t~malloc0.offset|), 42522#(= main_~root~0.offset 0), 42523#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 42524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4)) 0)), 42525#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (or (= main_~root~0.offset main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~root~0.offset 0)), 42526#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (or (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= (select |#valid| |main_#t~malloc22.base|) 1) (= (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) (+ main_~root~0.offset 4)) |main_#t~malloc22.offset|) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 42527#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 42528#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 42529#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (or (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) 1)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 42530#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 1))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 42531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (or (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))) 1) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))))), 42532#(and (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (or (and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4))))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.offset|) (+ main_~root~0.offset 4))) (not (= main_~n~0.base |main_#t~malloc13.base|))), 42533#(and (or (and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 42534#(and (or (and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|))), 42535#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 42536#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 42537#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))))), 42538#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 42539#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem5.offset| 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= |main_#t~mem5.base| 0))), 42540#(or (not |main_#t~short6|) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))))), 42541#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 42542#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 42543#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:02:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:41,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:02:41,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:02:41,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:02:41,899 INFO L87 Difference]: Start difference. First operand 984 states and 1245 transitions. Second operand 25 states. [2018-02-02 10:02:44,120 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 101 DAG size of output 63 [2018-02-02 10:02:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:02:46,560 INFO L93 Difference]: Finished difference Result 2341 states and 2983 transitions. [2018-02-02 10:02:46,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-02 10:02:46,561 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-02-02 10:02:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:02:46,565 INFO L225 Difference]: With dead ends: 2341 [2018-02-02 10:02:46,565 INFO L226 Difference]: Without dead ends: 2341 [2018-02-02 10:02:46,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2212 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1634, Invalid=6022, Unknown=0, NotChecked=0, Total=7656 [2018-02-02 10:02:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2018-02-02 10:02:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1520. [2018-02-02 10:02:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2018-02-02 10:02:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1968 transitions. [2018-02-02 10:02:46,579 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1968 transitions. Word has length 72 [2018-02-02 10:02:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:02:46,579 INFO L432 AbstractCegarLoop]: Abstraction has 1520 states and 1968 transitions. [2018-02-02 10:02:46,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:02:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1968 transitions. [2018-02-02 10:02:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:02:46,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:02:46,580 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, 1, 1, 1, 1, 1] [2018-02-02 10:02:46,580 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:02:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1581050403, now seen corresponding path program 1 times [2018-02-02 10:02:46,581 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:02:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:02:46,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:02:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:47,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:02:47,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-02-02 10:02:47,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:02:47,242 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:02:47,242 INFO L182 omatonBuilderFactory]: Interpolants [46531#true, 46532#false, 46533#(= 0 |main_#t~malloc0.offset|), 46534#(= main_~root~0.offset 0), 46535#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 46536#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 46537#(and (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 46538#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| main_~root~0.base))) (not |main_#t~short21|)) (= main_~root~0.offset 0)), 46539#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 46540#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 |main_#t~malloc28.offset|) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc28.base|))), 46541#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (not (= main_~s~0.base main_~root~0.base))), 46542#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) (+ main_~root~0.offset 4)))), 46543#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= main_~s~0.offset 0)), 46544#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 46545#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 46546#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem32.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem32.base|) (+ 0 4))) (= main_~st~0.offset 0)), 46547#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 46548#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)), 46549#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= 1 main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1)), 46550#(or (and (not (= main_~n~0.base |main_#t~malloc34.base|)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= 1 main_~n~0.offset))) (not (= 1 (select |#valid| main_~n~0.base)))), 46551#(or (and (not (= main_~n~0.base main_~st~0.base)) (or (<= 1 main_~n~0.offset) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~st~0.base (store (select |#memory_$Pointer$.offset| main_~st~0.base) main_~st~0.offset main_~s~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))))) (not (= 1 (select |#valid| main_~n~0.base)))), 46552#(and (not (= main_~n~0.base main_~st~0.base)) (or (<= 1 main_~n~0.offset) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~st~0.base (store (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4) |main_#t~mem37.offset|)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4) |main_#t~mem37.base|)) main_~n~0.base) (+ main_~n~0.offset 4))))) (= 1 (select |#valid| main_~n~0.base))), 46553#(and (or (<= 1 main_~n~0.offset) (and (= |main_#t~mem38.base| 0) (= |main_#t~mem38.offset| 0))) (= (select |#valid| main_~n~0.base) 1)), 46554#(and (<= 1 main_~n~0.offset) (= (select |#valid| main_~n~0.base) 1)), 46555#(and (<= 1 main_~n~0.offset) (not (= main_~n~0.base |main_#t~malloc39.base|))), 46556#(and (<= 1 main_~n~0.offset) (not (= main_~n~0.base main_~st~0.base))), 46557#(<= 1 main_~n~0.offset)] [2018-02-02 10:02:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:02:47,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:02:47,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:02:47,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:02:47,242 INFO L87 Difference]: Start difference. First operand 1520 states and 1968 transitions. Second operand 27 states. Received shutdown request... [2018-02-02 10:02:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:02:48,271 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:02:48,275 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:02:48,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:02:48 BoogieIcfgContainer [2018-02-02 10:02:48,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:02:48,276 INFO L168 Benchmark]: Toolchain (without parser) took 50913.87 ms. Allocated memory was 402.1 MB in the beginning and 1.3 GB in the end (delta: 901.3 MB). Free memory was 358.8 MB in the beginning and 757.8 MB in the end (delta: -399.0 MB). Peak memory consumption was 502.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:02:48,277 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:02:48,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.26 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 348.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:02:48,277 INFO L168 Benchmark]: Boogie Preprocessor took 27.45 ms. Allocated memory is still 402.1 MB. Free memory was 348.3 MB in the beginning and 345.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:02:48,277 INFO L168 Benchmark]: RCFGBuilder took 370.05 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 304.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:02:48,277 INFO L168 Benchmark]: TraceAbstraction took 50355.70 ms. Allocated memory was 402.1 MB in the beginning and 1.3 GB in the end (delta: 901.3 MB). Free memory was 304.6 MB in the beginning and 757.8 MB in the end (delta: -453.2 MB). Peak memory consumption was 448.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:02:48,278 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 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.26 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 348.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.45 ms. Allocated memory is still 402.1 MB. Free memory was 348.3 MB in the beginning and 345.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 370.05 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 304.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50355.70 ms. Allocated memory was 402.1 MB in the beginning and 1.3 GB in the end (delta: 901.3 MB). Free memory was 304.6 MB in the beginning and 757.8 MB in the end (delta: -453.2 MB). Peak memory consumption was 448.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1520states) and interpolant automaton (currently 24 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 65 error locations. TIMEOUT Result, 50.3s OverallTime, 55 OverallIterations, 4 TraceHistogramMax, 36.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5936 SDtfs, 20851 SDslu, 30133 SDs, 0 SdLazy, 34160 SolverSat, 3066 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1394 GetRequests, 126 SyntacticMatches, 33 SemanticMatches, 1234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12678 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1520occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 120/345 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 7498 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 2180 NumberOfCodeBlocks, 2180 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1743139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 37 PerfectInterpolantSequences, 120/345 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-02-48-286.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-02-48-286.csv Completed graceful shutdown