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/list-ext-properties/list-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:07:48,997 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:07:48,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:07:49,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:07:49,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:07:49,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:07:49,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:07:49,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:07:49,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:07:49,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:07:49,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:07:49,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:07:49,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:07:49,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:07:49,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:07:49,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:07:49,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:07:49,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:07:49,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:07:49,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:07:49,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:07:49,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:07:49,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:07:49,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:07:49,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:07:49,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:07:49,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:07:49,031 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:07:49,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:07:49,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:07:49,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:07:49,032 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:07:49,041 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:07:49,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:07:49,042 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:07:49,043 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:07:49,043 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:07:49,043 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:07:49,043 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:07:49,043 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:07:49,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:07:49,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:07:49,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:07:49,044 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:07:49,044 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:07:49,044 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:07:49,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:07:49,045 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:07:49,045 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:07:49,045 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:07:49,045 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:07:49,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:07:49,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:07:49,046 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:07:49,046 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:07:49,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:07:49,079 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:07:49,081 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:07:49,082 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:07:49,083 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:07:49,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-02-02 10:07:49,225 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:07:49,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:07:49,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:07:49,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:07:49,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:07:49,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778cb96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49, skipping insertion in model container [2018-02-02 10:07:49,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,252 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:07:49,281 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:07:49,373 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:07:49,388 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:07:49,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49 WrapperNode [2018-02-02 10:07:49,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:07:49,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:07:49,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:07:49,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:07:49,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (1/1) ... [2018-02-02 10:07:49,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:07:49,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:07:49,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:07:49,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:07:49,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (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:07:49,463 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:07:49,463 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:07:49,463 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 10:07:49,463 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:07:49,463 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:07:49,463 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:07:49,463 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:07:49,464 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:07:49,744 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:07:49,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:07:49 BoogieIcfgContainer [2018-02-02 10:07:49,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:07:49,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:07:49,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:07:49,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:07:49,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:07:49" (1/3) ... [2018-02-02 10:07:49,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b8b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:07:49, skipping insertion in model container [2018-02-02 10:07:49,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:07:49" (2/3) ... [2018-02-02 10:07:49,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b8b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:07:49, skipping insertion in model container [2018-02-02 10:07:49,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:07:49" (3/3) ... [2018-02-02 10:07:49,751 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-02-02 10:07:49,757 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:07:49,762 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2018-02-02 10:07:49,787 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:07:49,787 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:07:49,788 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:07:49,788 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:07:49,788 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:07:49,788 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:07:49,788 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:07:49,788 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:07:49,789 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:07:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-02-02 10:07:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:07:49,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:49,809 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:49,810 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1146304688, now seen corresponding path program 1 times [2018-02-02 10:07:49,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:49,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:49,929 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:07:49,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:49,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:07:49,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:49,932 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:07:49,932 INFO L182 omatonBuilderFactory]: Interpolants [105#true, 106#false] [2018-02-02 10:07:49,932 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:07:49,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:07:49,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:07:49,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:07:49,944 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 2 states. [2018-02-02 10:07:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:50,022 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-02-02 10:07:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:07:50,023 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 10:07:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:50,029 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:07:50,029 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:07:50,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:07:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:07:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-02 10:07:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:07:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-02-02 10:07:50,057 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 13 [2018-02-02 10:07:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:50,058 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-02-02 10:07:50,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:07:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-02-02 10:07:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:07:50,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:50,058 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:50,058 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728880, now seen corresponding path program 1 times [2018-02-02 10:07:50,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:50,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:50,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:07:50,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:50,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:07:50,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:50,128 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:07:50,128 INFO L182 omatonBuilderFactory]: Interpolants [304#(= 1 (select |#valid| |main_#t~malloc0.base|)), 305#(= 1 (select |#valid| main_~a~0.base)), 306#(= 1 (select |#valid| main_~p~0.base)), 302#true, 303#false] [2018-02-02 10:07:50,128 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:07:50,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:07:50,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:07:50,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:07:50,130 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 5 states. [2018-02-02 10:07:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:50,300 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-02-02 10:07:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:07:50,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:07:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:50,301 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:07:50,301 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:07:50,302 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:07:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:07:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-02-02 10:07:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:07:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-02-02 10:07:50,306 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 15 [2018-02-02 10:07:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:50,307 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-02-02 10:07:50,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:07:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-02-02 10:07:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:07:50,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:50,307 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:50,307 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728879, now seen corresponding path program 1 times [2018-02-02 10:07:50,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:50,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:50,385 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:07:50,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:50,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:07:50,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:50,385 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:07:50,385 INFO L182 omatonBuilderFactory]: Interpolants [523#true, 524#false, 525#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 526#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 527#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:07:50,385 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:07:50,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:07:50,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:07:50,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:07:50,386 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 5 states. [2018-02-02 10:07:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:50,539 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-02-02 10:07:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:07:50,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:07:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:50,540 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:07:50,540 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:07:50,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:07:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:07:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-02-02 10:07:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:07:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-02 10:07:50,547 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 15 [2018-02-02 10:07:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:50,547 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-02 10:07:50,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:07:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-02 10:07:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:07:50,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:50,548 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:50,548 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:50,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389118, now seen corresponding path program 1 times [2018-02-02 10:07:50,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:50,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:50,622 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:07:50,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:50,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:07:50,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:50,623 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:07:50,623 INFO L182 omatonBuilderFactory]: Interpolants [787#true, 788#false, 789#(= 1 (select |#valid| |main_#t~malloc5.base|)), 790#(= 1 (select |#valid| main_~t~0.base)), 791#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 792#(= 1 (select |#valid| |main_#t~mem7.base|)), 793#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:50,623 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:07:50,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:07:50,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:07:50,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:07:50,624 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 7 states. [2018-02-02 10:07:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:50,911 INFO L93 Difference]: Finished difference Result 233 states and 260 transitions. [2018-02-02 10:07:50,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:07:50,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:07:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:50,913 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:07:50,913 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:07:50,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:07:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:07:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 127. [2018-02-02 10:07:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:07:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-02-02 10:07:50,921 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 26 [2018-02-02 10:07:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:50,921 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-02-02 10:07:50,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:07:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-02-02 10:07:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:07:50,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:50,922 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:50,922 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389119, now seen corresponding path program 1 times [2018-02-02 10:07:50,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:50,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:51,024 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:07:51,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:51,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:07:51,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:51,025 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:07:51,025 INFO L182 omatonBuilderFactory]: Interpolants [1168#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1169#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1170#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 1171#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 1165#true, 1166#false, 1167#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|)))] [2018-02-02 10:07:51,029 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:07:51,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:07:51,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:07:51,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:07:51,029 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 7 states. [2018-02-02 10:07:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:51,307 INFO L93 Difference]: Finished difference Result 248 states and 277 transitions. [2018-02-02 10:07:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:07:51,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:07:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:51,308 INFO L225 Difference]: With dead ends: 248 [2018-02-02 10:07:51,308 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:07:51,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:07:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:07:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 108. [2018-02-02 10:07:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:07:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-02-02 10:07:51,314 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 26 [2018-02-02 10:07:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:51,315 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-02-02 10:07:51,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:07:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-02-02 10:07:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:07:51,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:51,316 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] [2018-02-02 10:07:51,316 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash 356417959, now seen corresponding path program 1 times [2018-02-02 10:07:51,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:51,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:51,397 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:07:51,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:51,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:07:51,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:51,398 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:07:51,398 INFO L182 omatonBuilderFactory]: Interpolants [1543#true, 1544#false, 1545#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1546#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1547#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 1548#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 1549#(= |main_#t~mem17| 3)] [2018-02-02 10:07:51,398 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:07:51,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:07:51,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:07:51,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:07:51,399 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 7 states. [2018-02-02 10:07:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:51,508 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-02-02 10:07:51,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:07:51,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-02 10:07:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:51,509 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:07:51,509 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:07:51,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:07:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:07:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 122. [2018-02-02 10:07:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:07:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-02-02 10:07:51,514 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 28 [2018-02-02 10:07:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:51,514 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-02-02 10:07:51,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:07:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-02-02 10:07:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:07:51,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:51,515 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:51,515 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash 167170662, now seen corresponding path program 1 times [2018-02-02 10:07:51,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:51,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:51,566 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:07:51,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:51,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:07:51,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:51,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:07:51,567 INFO L182 omatonBuilderFactory]: Interpolants [1865#true, 1866#false, 1867#(= 1 (select |#valid| |main_#t~malloc12.base|)), 1868#(= 1 (select |#valid| main_~t~0.base)), 1869#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1870#(= 1 (select |#valid| |main_#t~mem14.base|)), 1871#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:51,567 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:07:51,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:07:51,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:07:51,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:07:51,567 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 7 states. [2018-02-02 10:07:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:51,758 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2018-02-02 10:07:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:07:51,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:07:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:51,759 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:07:51,760 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:07:51,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:07:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:07:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-02-02 10:07:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:07:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-02-02 10:07:51,768 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 30 [2018-02-02 10:07:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:51,769 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-02-02 10:07:51,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:07:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-02-02 10:07:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:07:51,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:51,770 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:51,770 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash 167170663, now seen corresponding path program 1 times [2018-02-02 10:07:51,771 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:51,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:51,858 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:07:51,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:51,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:07:51,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:51,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:07:51,859 INFO L182 omatonBuilderFactory]: Interpolants [2164#true, 2165#false, 2166#(and (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|))), 2167#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 2168#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 2169#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 2170#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:07:51,859 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:07:51,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:07:51,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:07:51,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:07:51,860 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 7 states. [2018-02-02 10:07:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:52,279 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-02-02 10:07:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:07:52,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:07:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:52,280 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:07:52,280 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:07:52,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:07:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:07:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 103. [2018-02-02 10:07:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:07:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-02-02 10:07:52,283 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 30 [2018-02-02 10:07:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:52,283 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-02-02 10:07:52,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:07:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-02-02 10:07:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:07:52,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:52,284 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] [2018-02-02 10:07:52,284 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1351001059, now seen corresponding path program 1 times [2018-02-02 10:07:52,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:52,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:52,346 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:07:52,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:52,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:07:52,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:52,347 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:07:52,347 INFO L182 omatonBuilderFactory]: Interpolants [2464#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))), 2465#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 2466#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 2467#(= 3 |main_#t~mem20|), 2461#true, 2462#false, 2463#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:07:52,347 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:07:52,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:07:52,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:07:52,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:07:52,348 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 7 states. [2018-02-02 10:07:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:52,456 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2018-02-02 10:07:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:07:52,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 10:07:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:52,457 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:07:52,457 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:07:52,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:07:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:07:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2018-02-02 10:07:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:07:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-02 10:07:52,460 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 31 [2018-02-02 10:07:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:52,460 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-02 10:07:52,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:07:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-02 10:07:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:07:52,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:52,461 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:52,461 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 730013695, now seen corresponding path program 1 times [2018-02-02 10:07:52,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:52,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:52,552 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:07:52,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:52,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:07:52,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:52,553 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:07:52,554 INFO L182 omatonBuilderFactory]: Interpolants [2736#(= |#valid| |old(#valid)|), 2737#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 2738#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (not (= 0 main_~a~0.base))), 2739#(and (not (= 0 main_~p~0.base)) (= (store |#valid| main_~p~0.base (select (store |#valid| main_~p~0.base 0) main_~p~0.base)) |old(#valid)|)), 2734#true, 2735#false] [2018-02-02 10:07:52,554 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:07:52,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:07:52,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:07:52,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:07:52,555 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2018-02-02 10:07:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:52,713 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-02-02 10:07:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:07:52,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:07:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:52,715 INFO L225 Difference]: With dead ends: 135 [2018-02-02 10:07:52,715 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:07:52,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:07:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:07:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-02-02 10:07:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:07:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-02-02 10:07:52,718 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 36 [2018-02-02 10:07:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:52,718 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-02-02 10:07:52,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:07:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-02-02 10:07:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:07:52,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:52,719 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:52,720 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash 150288015, now seen corresponding path program 1 times [2018-02-02 10:07:52,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:52,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:52,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:52,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:07:52,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:52,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:07:52,860 INFO L182 omatonBuilderFactory]: Interpolants [2995#true, 2996#false, 2997#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2998#(and (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 2999#(and (= main_~p~0.offset main_~a~0.offset) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 3000#(and (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 3001#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 3002#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 3003#(and (not (= main_~p~0.base main_~a~0.base)) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset) 2)), 3004#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 3005#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 3006#(= |main_#t~mem17| 2)] [2018-02-02 10:07:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:52,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:07:52,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:07:52,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:07:52,860 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 12 states. [2018-02-02 10:07:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:53,155 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2018-02-02 10:07:53,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:07:53,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-02 10:07:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:53,156 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:07:53,156 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 10:07:53,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:07:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 10:07:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 129. [2018-02-02 10:07:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:07:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-02-02 10:07:53,158 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 39 [2018-02-02 10:07:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:53,158 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-02-02 10:07:53,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:07:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-02-02 10:07:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:07:53,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:53,159 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:07:53,159 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:53,160 INFO L82 PathProgramCache]: Analyzing trace with hash -426664424, now seen corresponding path program 1 times [2018-02-02 10:07:53,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:53,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:53,282 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:07:53,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:07:53,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:07:53,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:53,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:07:53,283 INFO L182 omatonBuilderFactory]: Interpolants [3362#true, 3363#false, 3364#(= 0 |main_#t~malloc0.offset|), 3365#(= 0 main_~a~0.offset), 3366#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3367#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 3368#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 3369#(and (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.base| 0))] [2018-02-02 10:07:53,283 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:07:53,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:07:53,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:07:53,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:07:53,283 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 8 states. [2018-02-02 10:07:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:53,443 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-02-02 10:07:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:07:53,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 10:07:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:53,444 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:07:53,444 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:07:53,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:07:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:07:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2018-02-02 10:07:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:07:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-02 10:07:53,447 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 39 [2018-02-02 10:07:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:53,447 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-02 10:07:53,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:07:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-02 10:07:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:07:53,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:53,448 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:53,449 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash 62556409, now seen corresponding path program 1 times [2018-02-02 10:07:53,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:53,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:53,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:53,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:07:53,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:53,616 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:07:53,616 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 3649#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 3650#(= 1 (select |#valid| |main_#t~mem19.base|)), 3651#(= 1 (select |#valid| main_~p~0.base)), 3636#true, 3637#false, 3638#(= 0 |main_#t~malloc0.offset|), 3639#(= 0 main_~a~0.offset), 3640#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3641#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3642#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3643#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3644#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3645#(and (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 3646#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 3647#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))))] [2018-02-02 10:07:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:53,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:07:53,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:07:53,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:07:53,616 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 16 states. [2018-02-02 10:07:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:54,137 INFO L93 Difference]: Finished difference Result 237 states and 264 transitions. [2018-02-02 10:07:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:07:54,137 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-02 10:07:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:54,138 INFO L225 Difference]: With dead ends: 237 [2018-02-02 10:07:54,138 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 10:07:54,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:07:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 10:07:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 139. [2018-02-02 10:07:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:07:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2018-02-02 10:07:54,142 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 39 [2018-02-02 10:07:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:54,142 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2018-02-02 10:07:54,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:07:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2018-02-02 10:07:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:07:54,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:54,143 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:54,143 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash 62556410, now seen corresponding path program 1 times [2018-02-02 10:07:54,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:54,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:54,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:54,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:07:54,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:54,374 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:07:54,374 INFO L182 omatonBuilderFactory]: Interpolants [4064#true, 4065#false, 4066#(= 0 |main_#t~malloc0.offset|), 4067#(= 0 main_~a~0.offset), 4068#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4069#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4070#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4071#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4072#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 4073#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 4074#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4075#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4076#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4077#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 4078#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 4079#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:07:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:54,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:07:54,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:07:54,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:07:54,375 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand 16 states. [2018-02-02 10:07:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:54,947 INFO L93 Difference]: Finished difference Result 244 states and 273 transitions. [2018-02-02 10:07:54,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:07:54,947 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-02 10:07:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:54,948 INFO L225 Difference]: With dead ends: 244 [2018-02-02 10:07:54,948 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 10:07:54,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:07:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 10:07:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 137. [2018-02-02 10:07:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:07:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-02-02 10:07:54,951 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 39 [2018-02-02 10:07:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:54,952 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-02-02 10:07:54,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:07:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-02-02 10:07:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:07:54,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:54,952 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:54,952 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1957894661, now seen corresponding path program 1 times [2018-02-02 10:07:54,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:54,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:55,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:55,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:07:55,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:55,076 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:07:55,076 INFO L182 omatonBuilderFactory]: Interpolants [4489#true, 4490#false, 4491#(= 0 |main_#t~malloc0.offset|), 4492#(= 0 main_~a~0.offset), 4493#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4494#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4495#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 4496#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4497#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4498#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 4499#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4500#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4501#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 4502#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 4503#(= 1 (select |#valid| |main_#t~mem22.base|)), 4504#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:55,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:07:55,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:07:55,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:07:55,076 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 16 states. [2018-02-02 10:07:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:55,492 INFO L93 Difference]: Finished difference Result 223 states and 249 transitions. [2018-02-02 10:07:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:07:55,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-02-02 10:07:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:55,493 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:07:55,493 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:07:55,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:07:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:07:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 142. [2018-02-02 10:07:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:07:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2018-02-02 10:07:55,497 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 42 [2018-02-02 10:07:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:55,497 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2018-02-02 10:07:55,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:07:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2018-02-02 10:07:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:07:55,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:55,498 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:55,498 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:55,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1957894660, now seen corresponding path program 1 times [2018-02-02 10:07:55,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:55,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:55,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:55,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:07:55,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:55,681 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:07:55,681 INFO L182 omatonBuilderFactory]: Interpolants [4906#true, 4907#false, 4908#(= 0 |main_#t~malloc0.offset|), 4909#(= 0 main_~a~0.offset), 4910#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4911#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4912#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 4913#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4914#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 4915#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4916#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4917#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4918#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4919#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 4920#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 4921#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:07:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:55,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:07:55,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:07:55,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:07:55,681 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 16 states. [2018-02-02 10:07:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:56,106 INFO L93 Difference]: Finished difference Result 226 states and 252 transitions. [2018-02-02 10:07:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:07:56,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-02-02 10:07:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:56,107 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:07:56,107 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:07:56,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:07:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:07:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 142. [2018-02-02 10:07:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:07:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2018-02-02 10:07:56,111 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 42 [2018-02-02 10:07:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:56,111 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2018-02-02 10:07:56,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:07:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2018-02-02 10:07:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:07:56,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:56,113 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:56,113 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 64914257, now seen corresponding path program 1 times [2018-02-02 10:07:56,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:56,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:07:56,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:56,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:07:56,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:56,235 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:07:56,235 INFO L182 omatonBuilderFactory]: Interpolants [5328#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 5329#(= 1 |main_#t~mem17|), 5318#true, 5319#false, 5320#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5321#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5322#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5323#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5324#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5325#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 5326#(and (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 5327#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))] [2018-02-02 10:07:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:07:56,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:07:56,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:07:56,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:07:56,235 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 12 states. [2018-02-02 10:07:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:56,448 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2018-02-02 10:07:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:07:56,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:07:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:56,449 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:07:56,449 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:07:56,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:07:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:07:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 142. [2018-02-02 10:07:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:07:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2018-02-02 10:07:56,451 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 42 [2018-02-02 10:07:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:56,451 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2018-02-02 10:07:56,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:07:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2018-02-02 10:07:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:07:56,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:56,452 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:07:56,452 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:56,452 INFO L82 PathProgramCache]: Analyzing trace with hash 14871033, now seen corresponding path program 2 times [2018-02-02 10:07:56,452 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:56,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:56,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:56,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:07:56,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:56,669 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:07:56,669 INFO L182 omatonBuilderFactory]: Interpolants [5730#true, 5731#false, 5732#(= 0 |main_#t~malloc0.offset|), 5733#(= 0 main_~a~0.offset), 5734#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5735#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5736#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5737#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 5738#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5739#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 5740#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5741#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 5742#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 5743#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 5744#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 3), 5745#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5746#(= |main_#t~mem17| 3)] [2018-02-02 10:07:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:56,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:07:56,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:07:56,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:07:56,670 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 17 states. [2018-02-02 10:07:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:57,224 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2018-02-02 10:07:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:07:57,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-02-02 10:07:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:57,225 INFO L225 Difference]: With dead ends: 221 [2018-02-02 10:07:57,225 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 10:07:57,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:07:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 10:07:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 145. [2018-02-02 10:07:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:07:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-02-02 10:07:57,227 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 44 [2018-02-02 10:07:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:57,227 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-02-02 10:07:57,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:07:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-02-02 10:07:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:07:57,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:57,228 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] [2018-02-02 10:07:57,228 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2058720025, now seen corresponding path program 1 times [2018-02-02 10:07:57,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:57,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:57,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:57,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:07:57,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:57,385 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:07:57,385 INFO L182 omatonBuilderFactory]: Interpolants [6160#(= 2 |main_#t~mem20|), 6149#true, 6150#false, 6151#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 6152#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6153#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6154#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6155#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6156#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 6157#(and (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 6158#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 6159#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))] [2018-02-02 10:07:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:57,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:07:57,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:07:57,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:07:57,385 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 12 states. [2018-02-02 10:07:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:57,687 INFO L93 Difference]: Finished difference Result 219 states and 242 transitions. [2018-02-02 10:07:57,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:07:57,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-02-02 10:07:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:57,689 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:07:57,689 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:07:57,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:07:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:07:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 145. [2018-02-02 10:07:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:07:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2018-02-02 10:07:57,692 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 47 [2018-02-02 10:07:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:57,692 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2018-02-02 10:07:57,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:07:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2018-02-02 10:07:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:07:57,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:57,693 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:07:57,693 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash 465635722, now seen corresponding path program 2 times [2018-02-02 10:07:57,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:57,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:57,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:57,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:07:57,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:57,931 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:07:57,931 INFO L182 omatonBuilderFactory]: Interpolants [6541#true, 6542#false, 6543#(= 0 |main_#t~malloc0.offset|), 6544#(= 0 main_~a~0.offset), 6545#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6546#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6547#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 6548#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 6549#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6550#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem14.offset|)), 6551#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6552#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 6553#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 6554#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3), 6555#(= (select (select |#memory_int| |main_#t~mem22.base|) |main_#t~mem22.offset|) 3), 6556#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 6557#(= |main_#t~mem20| 3)] [2018-02-02 10:07:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:57,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:07:57,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:07:57,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:07:57,932 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand 17 states. [2018-02-02 10:07:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:58,509 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2018-02-02 10:07:58,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:07:58,509 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:07:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:58,510 INFO L225 Difference]: With dead ends: 200 [2018-02-02 10:07:58,510 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 10:07:58,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:07:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 10:07:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 148. [2018-02-02 10:07:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:07:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-02 10:07:58,514 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 47 [2018-02-02 10:07:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:58,514 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-02 10:07:58,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:07:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-02 10:07:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:07:58,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:58,515 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:58,515 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1104052817, now seen corresponding path program 1 times [2018-02-02 10:07:58,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:58,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:58,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:58,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:07:58,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:58,787 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:07:58,787 INFO L182 omatonBuilderFactory]: Interpolants [6944#(= 0 |main_#t~malloc0.offset|), 6945#(= 0 main_~a~0.offset), 6946#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6947#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6948#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6949#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 6950#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6951#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 6952#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6953#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 6954#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 6955#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 6956#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 3), 6957#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 6958#(= |main_#t~mem20| 3), 6942#true, 6943#false] [2018-02-02 10:07:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:58,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:07:58,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:07:58,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:07:58,788 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 17 states. [2018-02-02 10:07:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:59,401 INFO L93 Difference]: Finished difference Result 206 states and 224 transitions. [2018-02-02 10:07:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:07:59,401 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:07:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:59,402 INFO L225 Difference]: With dead ends: 206 [2018-02-02 10:07:59,402 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 10:07:59,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:07:59,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 10:07:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 148. [2018-02-02 10:07:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:07:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-02 10:07:59,404 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 47 [2018-02-02 10:07:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:59,404 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-02 10:07:59,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:07:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-02 10:07:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:07:59,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:59,404 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:07:59,405 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1463557977, now seen corresponding path program 2 times [2018-02-02 10:07:59,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:59,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:59,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:59,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:07:59,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:59,615 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:07:59,615 INFO L182 omatonBuilderFactory]: Interpolants [7360#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 7361#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 7362#(and (not (= main_~p~0.base main_~a~0.base)) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset) 2)), 7363#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 7364#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 7365#(= |main_#t~mem17| 2), 7349#true, 7350#false, 7351#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 7352#(and (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7353#(and (= main_~p~0.offset main_~a~0.offset) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7354#(and (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7355#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7356#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 7357#(and (= (select |#valid| main_~a~0.base) 1) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset) 2) (not (= main_~p~0.base main_~a~0.base))), 7358#(and (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 7359#(and (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base main_~t~0.base)))] [2018-02-02 10:07:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:59,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:07:59,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:07:59,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:07:59,616 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 17 states. [2018-02-02 10:08:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:00,013 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2018-02-02 10:08:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:08:00,014 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-02-02 10:08:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:00,015 INFO L225 Difference]: With dead ends: 236 [2018-02-02 10:08:00,015 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 10:08:00,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:08:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 10:08:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 165. [2018-02-02 10:08:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:08:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-02-02 10:08:00,019 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 50 [2018-02-02 10:08:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:00,019 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-02-02 10:08:00,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:08:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-02-02 10:08:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:08:00,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:00,020 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:00,020 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -949630979, now seen corresponding path program 1 times [2018-02-02 10:08:00,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:00,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:00,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:00,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:08:00,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:00,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:08:00,334 INFO L182 omatonBuilderFactory]: Interpolants [7808#(= 1 (select |#valid| |main_#t~mem19.base|)), 7809#(= 1 (select |#valid| main_~p~0.base)), 7789#true, 7790#false, 7791#(= 0 |main_#t~malloc0.offset|), 7792#(= 0 main_~a~0.offset), 7793#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7794#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7795#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7796#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 7797#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7798#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 7799#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7800#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7801#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 7802#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 7803#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 7804#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 7805#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 7806#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 7807#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))] [2018-02-02 10:08:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:00,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:08:00,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:08:00,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:08:00,335 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 21 states. [2018-02-02 10:08:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:01,107 INFO L93 Difference]: Finished difference Result 268 states and 298 transitions. [2018-02-02 10:08:01,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:08:01,107 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-02-02 10:08:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:01,108 INFO L225 Difference]: With dead ends: 268 [2018-02-02 10:08:01,108 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 10:08:01,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:08:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 10:08:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 186. [2018-02-02 10:08:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:08:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2018-02-02 10:08:01,110 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 50 [2018-02-02 10:08:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:01,110 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2018-02-02 10:08:01,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:08:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2018-02-02 10:08:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:08:01,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:01,111 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:01,111 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash -949630978, now seen corresponding path program 1 times [2018-02-02 10:08:01,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:01,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:01,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:01,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:08:01,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:01,572 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:08:01,572 INFO L182 omatonBuilderFactory]: Interpolants [8320#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8321#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8322#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8323#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 8324#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 8325#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 8326#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8327#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 8328#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 8329#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 8330#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 8331#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 8310#true, 8311#false, 8312#(= 0 |main_#t~malloc0.offset|), 8313#(= 0 main_~a~0.offset), 8314#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8315#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8316#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8317#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 8318#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8319#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)))] [2018-02-02 10:08:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:01,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:08:01,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:08:01,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:08:01,573 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand 22 states. [2018-02-02 10:08:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:02,848 INFO L93 Difference]: Finished difference Result 296 states and 329 transitions. [2018-02-02 10:08:02,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:08:02,849 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-02-02 10:08:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:02,849 INFO L225 Difference]: With dead ends: 296 [2018-02-02 10:08:02,850 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 10:08:02,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=1524, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:08:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 10:08:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 184. [2018-02-02 10:08:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:08:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2018-02-02 10:08:02,852 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 50 [2018-02-02 10:08:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:02,853 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2018-02-02 10:08:02,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:08:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2018-02-02 10:08:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:08:02,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:02,853 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:02,853 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1037362585, now seen corresponding path program 3 times [2018-02-02 10:08:02,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:02,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:03,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:03,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:08:03,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:03,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:08:03,127 INFO L182 omatonBuilderFactory]: Interpolants [8864#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8865#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 8866#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8867#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 8868#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 8869#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 8870#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|))), 8871#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 8872#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 8873#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 8874#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 8875#(= 1 (select |#valid| |main_#t~mem19.base|)), 8876#(= 1 (select |#valid| main_~p~0.base)), 8856#true, 8857#false, 8858#(= 0 |main_#t~malloc0.offset|), 8859#(= 0 main_~a~0.offset), 8860#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8861#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8862#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8863#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:03,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:08:03,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:08:03,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:08:03,127 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 21 states. [2018-02-02 10:08:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:03,951 INFO L93 Difference]: Finished difference Result 299 states and 336 transitions. [2018-02-02 10:08:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:08:03,951 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-02-02 10:08:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:03,952 INFO L225 Difference]: With dead ends: 299 [2018-02-02 10:08:03,952 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 10:08:03,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1437, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:08:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 10:08:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 209. [2018-02-02 10:08:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:08:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2018-02-02 10:08:03,954 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 50 [2018-02-02 10:08:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:03,954 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2018-02-02 10:08:03,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:08:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2018-02-02 10:08:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:08:03,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:03,955 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:03,955 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1037362584, now seen corresponding path program 2 times [2018-02-02 10:08:03,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:03,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:04,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:04,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:08:04,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:04,349 INFO L182 omatonBuilderFactory]: Interpolants [9440#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 9441#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 9442#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 9443#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 9444#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9445#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 9446#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 9447#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 9448#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 9449#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 9429#true, 9430#false, 9431#(= 0 |main_#t~malloc0.offset|), 9432#(= 0 main_~a~0.offset), 9433#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9435#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 9436#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 9437#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9438#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1)), 9439#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:08:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:04,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:08:04,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:08:04,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:08:04,350 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 21 states. [2018-02-02 10:08:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:05,281 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2018-02-02 10:08:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:08:05,282 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-02-02 10:08:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:05,282 INFO L225 Difference]: With dead ends: 327 [2018-02-02 10:08:05,283 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 10:08:05,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:08:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 10:08:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 195. [2018-02-02 10:08:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 10:08:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2018-02-02 10:08:05,286 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 50 [2018-02-02 10:08:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:05,287 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2018-02-02 10:08:05,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:08:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2018-02-02 10:08:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:08:05,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:05,288 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:05,288 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash -889640264, now seen corresponding path program 1 times [2018-02-02 10:08:05,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:05,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:05,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:05,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:08:05,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:05,444 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:08:05,444 INFO L182 omatonBuilderFactory]: Interpolants [10016#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10017#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10018#(and (not (= 0 |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 10019#(and (= 0 main_~a~0.offset) (not (= 0 main_~t~0.base)) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10020#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 10021#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10022#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10023#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 10024#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10025#(not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 10026#(not (= 0 |main_#t~mem24.base|)), 10012#true, 10013#false, 10014#(= 0 |main_#t~malloc0.offset|), 10015#(= 0 main_~a~0.offset)] [2018-02-02 10:08:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:05,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:08:05,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:08:05,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:08:05,445 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand 15 states. [2018-02-02 10:08:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:05,835 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2018-02-02 10:08:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:08:05,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 10:08:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:05,836 INFO L225 Difference]: With dead ends: 256 [2018-02-02 10:08:05,836 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 10:08:05,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:08:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 10:08:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 204. [2018-02-02 10:08:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:08:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2018-02-02 10:08:05,838 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 52 [2018-02-02 10:08:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:05,838 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2018-02-02 10:08:05,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:08:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2018-02-02 10:08:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:08:05,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:05,839 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:05,839 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2116752977, now seen corresponding path program 1 times [2018-02-02 10:08:05,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:05,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:06,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:06,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:08:06,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:06,031 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:08:06,031 INFO L182 omatonBuilderFactory]: Interpolants [10513#true, 10514#false, 10515#(= 0 |main_#t~malloc0.offset|), 10516#(= 0 main_~a~0.offset), 10517#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10518#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10519#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 10520#(and (= 0 main_~a~0.offset) (not (= 0 main_~t~0.base)) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10521#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 10522#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10523#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10524#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 10525#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10526#(not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 10527#(not (= 0 |main_#t~mem24.base|))] [2018-02-02 10:08:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:06,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:08:06,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:08:06,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:08:06,032 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 15 states. [2018-02-02 10:08:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:06,379 INFO L93 Difference]: Finished difference Result 251 states and 278 transitions. [2018-02-02 10:08:06,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:08:06,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 10:08:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:06,380 INFO L225 Difference]: With dead ends: 251 [2018-02-02 10:08:06,380 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 10:08:06,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:08:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 10:08:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 201. [2018-02-02 10:08:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-02 10:08:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2018-02-02 10:08:06,383 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 52 [2018-02-02 10:08:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:06,383 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2018-02-02 10:08:06,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:08:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2018-02-02 10:08:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:08:06,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:06,383 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:06,383 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2115036387, now seen corresponding path program 3 times [2018-02-02 10:08:06,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:06,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:06,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:06,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:08:06,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:06,657 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:08:06,657 INFO L182 omatonBuilderFactory]: Interpolants [11008#(= 0 |main_#t~malloc0.offset|), 11009#(= 0 main_~a~0.offset), 11010#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11011#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11012#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 11013#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 11014#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11015#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 11016#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11017#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11018#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 11019#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 11020#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 11021#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 11022#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 11023#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 11024#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 11025#(= 1 (select |#valid| |main_#t~mem22.base|)), 11026#(= 1 (select |#valid| main_~p~0.base)), 11006#true, 11007#false] [2018-02-02 10:08:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:06,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:08:06,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:08:06,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:08:06,658 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand 21 states. [2018-02-02 10:08:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:07,299 INFO L93 Difference]: Finished difference Result 292 states and 325 transitions. [2018-02-02 10:08:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:08:07,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-02-02 10:08:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:07,300 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:08:07,300 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:08:07,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:08:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:08:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 223. [2018-02-02 10:08:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:08:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2018-02-02 10:08:07,302 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 53 [2018-02-02 10:08:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:07,302 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2018-02-02 10:08:07,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:08:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2018-02-02 10:08:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:08:07,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:07,303 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:07,303 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2115036388, now seen corresponding path program 2 times [2018-02-02 10:08:07,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:07,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:07,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:07,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:08:07,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:07,574 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:08:07,574 INFO L182 omatonBuilderFactory]: Interpolants [11584#true, 11585#false, 11586#(= 0 |main_#t~malloc0.offset|), 11587#(= 0 main_~a~0.offset), 11588#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11589#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11590#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 11591#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 11592#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11593#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11594#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11595#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11596#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11597#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 11598#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 11599#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11600#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11601#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 11602#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11603#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 11604#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 11605#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:08:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:07,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:08:07,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:08:07,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:08:07,575 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand 22 states. [2018-02-02 10:08:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:08,323 INFO L93 Difference]: Finished difference Result 316 states and 350 transitions. [2018-02-02 10:08:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:08:08,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-02-02 10:08:08,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:08,324 INFO L225 Difference]: With dead ends: 316 [2018-02-02 10:08:08,324 INFO L226 Difference]: Without dead ends: 316 [2018-02-02 10:08:08,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1386, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:08:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-02 10:08:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 223. [2018-02-02 10:08:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:08:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2018-02-02 10:08:08,327 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 53 [2018-02-02 10:08:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:08,327 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2018-02-02 10:08:08,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:08:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2018-02-02 10:08:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:08:08,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:08,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:08,327 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 955823565, now seen corresponding path program 1 times [2018-02-02 10:08:08,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:08,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:08,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:08,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:08:08,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:08,549 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:08:08,549 INFO L182 omatonBuilderFactory]: Interpolants [12192#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12193#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset))), 12194#(and (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12195#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 12196#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12197#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12198#(and (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 12199#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 12200#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 12201#(= 1 |main_#t~mem17|), 12185#true, 12186#false, 12187#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12188#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12189#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12190#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12191#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:08,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:08:08,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:08:08,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:08:08,550 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand 17 states. [2018-02-02 10:08:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:09,017 INFO L93 Difference]: Finished difference Result 344 states and 383 transitions. [2018-02-02 10:08:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:08:09,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-02 10:08:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:09,018 INFO L225 Difference]: With dead ends: 344 [2018-02-02 10:08:09,018 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 10:08:09,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:08:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 10:08:09,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 250. [2018-02-02 10:08:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:08:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2018-02-02 10:08:09,020 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 53 [2018-02-02 10:08:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:09,021 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2018-02-02 10:08:09,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:08:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2018-02-02 10:08:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:08:09,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:09,021 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:09,021 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1316334813, now seen corresponding path program 2 times [2018-02-02 10:08:09,022 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:09,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:09,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:09,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:08:09,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:09,180 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:08:09,181 INFO L182 omatonBuilderFactory]: Interpolants [12832#(and (= (select |#valid| main_~a~0.base) 1) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 12833#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 12834#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 12835#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12836#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12837#(and (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 12838#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 12839#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 12840#(= 1 |main_#t~mem17|), 12824#true, 12825#false, 12826#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12827#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12828#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12829#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12830#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12831#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))] [2018-02-02 10:08:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:09,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:08:09,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:08:09,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:08:09,181 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand 17 states. [2018-02-02 10:08:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:09,578 INFO L93 Difference]: Finished difference Result 362 states and 404 transitions. [2018-02-02 10:08:09,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:08:09,578 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-02 10:08:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:09,579 INFO L225 Difference]: With dead ends: 362 [2018-02-02 10:08:09,579 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 10:08:09,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:08:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 10:08:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 248. [2018-02-02 10:08:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:08:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2018-02-02 10:08:09,582 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 53 [2018-02-02 10:08:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:09,582 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2018-02-02 10:08:09,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:08:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2018-02-02 10:08:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:08:09,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:09,583 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:09,583 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1875153729, now seen corresponding path program 1 times [2018-02-02 10:08:09,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:09,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:09,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:09,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:08:09,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:09,872 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:08:09,872 INFO L182 omatonBuilderFactory]: Interpolants [13473#true, 13474#false, 13475#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 13476#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 13477#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13478#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 13479#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 13480#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 13481#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13482#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (not (= 0 main_~a~0.base))), 13483#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 13484#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 13485#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 13486#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13487#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 13488#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem25.base|))), 13489#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 13490#(= 1 (select |#valid| main_~t~0.base)), 13491#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:08:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:09,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:08:09,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:08:09,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:08:09,873 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand 19 states. [2018-02-02 10:08:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:10,386 INFO L93 Difference]: Finished difference Result 295 states and 330 transitions. [2018-02-02 10:08:10,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:08:10,386 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-02 10:08:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:10,387 INFO L225 Difference]: With dead ends: 295 [2018-02-02 10:08:10,387 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 10:08:10,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:08:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 10:08:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 263. [2018-02-02 10:08:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 10:08:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 298 transitions. [2018-02-02 10:08:10,390 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 298 transitions. Word has length 55 [2018-02-02 10:08:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:10,390 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 298 transitions. [2018-02-02 10:08:10,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:08:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 298 transitions. [2018-02-02 10:08:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:08:10,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:10,390 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:10,390 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1875153728, now seen corresponding path program 1 times [2018-02-02 10:08:10,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:10,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:10,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:10,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:08:10,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:10,669 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:08:10,670 INFO L182 omatonBuilderFactory]: Interpolants [14086#true, 14087#false, 14088#(= 0 |main_#t~malloc0.offset|), 14089#(= 0 main_~a~0.offset), 14090#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14091#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 14092#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 14093#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 14094#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 14095#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 14096#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14097#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 14098#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 14099#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 14100#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 14101#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 14102#(and (= 8 (select |#length| |main_#t~mem25.base|)) (= main_~p~0.offset 0) (= 0 |main_#t~mem25.offset|)), 14103#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0)), 14104#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 14105#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:08:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:10,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:08:10,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:08:10,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:08:10,670 INFO L87 Difference]: Start difference. First operand 263 states and 298 transitions. Second operand 20 states. [2018-02-02 10:08:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:11,284 INFO L93 Difference]: Finished difference Result 308 states and 343 transitions. [2018-02-02 10:08:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:08:11,284 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-02 10:08:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:11,285 INFO L225 Difference]: With dead ends: 308 [2018-02-02 10:08:11,286 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 10:08:11,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:08:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 10:08:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 261. [2018-02-02 10:08:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:08:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 295 transitions. [2018-02-02 10:08:11,289 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 295 transitions. Word has length 55 [2018-02-02 10:08:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:11,289 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 295 transitions. [2018-02-02 10:08:11,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:08:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 295 transitions. [2018-02-02 10:08:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:08:11,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:11,290 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:11,290 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1480224117, now seen corresponding path program 2 times [2018-02-02 10:08:11,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:11,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:11,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:11,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:11,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:11,681 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:08:11,681 INFO L182 omatonBuilderFactory]: Interpolants [14720#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 14721#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14722#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 14723#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 14724#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~t~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2) (not (= main_~a~0.base main_~t~0.base))), 14725#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 14726#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset)), 14727#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))), 14728#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) 2)), 14729#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 main_~a~0.offset)), 14730#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2), 14731#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 2), 14732#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 14733#(= |main_#t~mem17| 2), 14711#true, 14712#false, 14713#(= 0 |main_#t~malloc0.offset|), 14714#(= 0 main_~a~0.offset), 14715#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14716#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 14717#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14718#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 14719#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:11,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:08:11,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:08:11,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:08:11,682 INFO L87 Difference]: Start difference. First operand 261 states and 295 transitions. Second operand 23 states. [2018-02-02 10:08:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:12,640 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2018-02-02 10:08:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:08:12,640 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-02-02 10:08:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:12,641 INFO L225 Difference]: With dead ends: 358 [2018-02-02 10:08:12,641 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 10:08:12,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:08:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 10:08:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 269. [2018-02-02 10:08:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:08:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 303 transitions. [2018-02-02 10:08:12,644 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 303 transitions. Word has length 55 [2018-02-02 10:08:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:12,644 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 303 transitions. [2018-02-02 10:08:12,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:08:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 303 transitions. [2018-02-02 10:08:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:08:12,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:12,645 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:12,645 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1367134586, now seen corresponding path program 1 times [2018-02-02 10:08:12,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:12,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:12,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:12,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:08:12,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:12,830 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:08:12,830 INFO L182 omatonBuilderFactory]: Interpolants [15424#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem25.base|))), 15425#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 15426#(= 1 (select |#valid| main_~t~0.base)), 15427#(= 1 (select |#valid| main_~p~0.base)), 15409#true, 15410#false, 15411#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 15412#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 15413#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 15414#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 15415#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 15416#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base))), 15417#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 15418#(and (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 main_~a~0.base))), 15419#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 15420#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 15421#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 15422#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 15423#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))))] [2018-02-02 10:08:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:12,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:08:12,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:08:12,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:08:12,831 INFO L87 Difference]: Start difference. First operand 269 states and 303 transitions. Second operand 19 states. [2018-02-02 10:08:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:13,388 INFO L93 Difference]: Finished difference Result 319 states and 355 transitions. [2018-02-02 10:08:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:08:13,388 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-02 10:08:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:13,389 INFO L225 Difference]: With dead ends: 319 [2018-02-02 10:08:13,389 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 10:08:13,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:08:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 10:08:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2018-02-02 10:08:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 10:08:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 310 transitions. [2018-02-02 10:08:13,391 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 310 transitions. Word has length 55 [2018-02-02 10:08:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:13,392 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 310 transitions. [2018-02-02 10:08:13,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:08:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 310 transitions. [2018-02-02 10:08:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:08:13,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:13,392 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:13,392 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1367134585, now seen corresponding path program 1 times [2018-02-02 10:08:13,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:13,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:13,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:13,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:08:13,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:13,704 INFO L182 omatonBuilderFactory]: Interpolants [16064#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16065#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 16066#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 16067#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 16068#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 16069#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 16070#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 16071#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 16072#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 16073#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 16074#(and (= 8 (select |#length| |main_#t~mem25.base|)) (= main_~p~0.offset 0) (= 0 |main_#t~mem25.offset|)), 16075#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0)), 16076#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 16077#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 16058#true, 16059#false, 16060#(= 0 |main_#t~malloc0.offset|), 16061#(= 0 main_~a~0.offset), 16062#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16063#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:13,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:08:13,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:08:13,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:08:13,705 INFO L87 Difference]: Start difference. First operand 275 states and 310 transitions. Second operand 20 states. [2018-02-02 10:08:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:14,372 INFO L93 Difference]: Finished difference Result 332 states and 368 transitions. [2018-02-02 10:08:14,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:08:14,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-02 10:08:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:14,373 INFO L225 Difference]: With dead ends: 332 [2018-02-02 10:08:14,373 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 10:08:14,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:08:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 10:08:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 260. [2018-02-02 10:08:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 10:08:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 294 transitions. [2018-02-02 10:08:14,376 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 294 transitions. Word has length 55 [2018-02-02 10:08:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:14,376 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 294 transitions. [2018-02-02 10:08:14,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:08:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 294 transitions. [2018-02-02 10:08:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:08:14,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:14,376 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:14,376 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash -220590773, now seen corresponding path program 4 times [2018-02-02 10:08:14,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:14,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:14,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:14,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:08:14,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:14,908 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:08:14,908 INFO L182 omatonBuilderFactory]: Interpolants [16706#true, 16707#false, 16708#(= 0 |main_#t~malloc0.offset|), 16709#(= 0 main_~a~0.offset), 16710#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16711#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 16712#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 16713#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 16714#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 16715#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 16716#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)) (<= (+ main_~p~0.offset 1) 0))), 16717#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 16718#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 16719#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 16720#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 16721#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 16722#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 16723#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 16724#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 16725#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 16726#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4)))) (= 0 |main_#t~mem19.offset|)), 16727#(or (<= (+ main_~p~0.offset 1) 0) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0))), 16728#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 16729#(= 1 (select |#valid| |main_#t~mem19.base|)), 16730#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:08:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:14,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:08:14,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:08:14,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:08:14,908 INFO L87 Difference]: Start difference. First operand 260 states and 294 transitions. Second operand 25 states. [2018-02-02 10:08:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:16,097 INFO L93 Difference]: Finished difference Result 366 states and 411 transitions. [2018-02-02 10:08:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:08:16,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-02-02 10:08:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:16,190 INFO L225 Difference]: With dead ends: 366 [2018-02-02 10:08:16,190 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 10:08:16,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=397, Invalid=2053, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:08:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 10:08:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 267. [2018-02-02 10:08:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 10:08:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 303 transitions. [2018-02-02 10:08:16,193 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 303 transitions. Word has length 55 [2018-02-02 10:08:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:16,193 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 303 transitions. [2018-02-02 10:08:16,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:08:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 303 transitions. [2018-02-02 10:08:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:08:16,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:16,193 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:16,193 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash -220590772, now seen corresponding path program 3 times [2018-02-02 10:08:16,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:16,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:16,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:16,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:08:16,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:16,868 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:08:16,868 INFO L182 omatonBuilderFactory]: Interpolants [17414#true, 17415#false, 17416#(= 0 |main_#t~malloc0.offset|), 17417#(= 0 main_~a~0.offset), 17418#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 17419#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17420#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 17421#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 17422#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17423#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 17424#(or (and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))) (<= (+ main_~p~0.offset 1) 0)), 17425#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 17426#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 17427#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 17428#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 17429#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 17430#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 17431#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))), 17432#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 17433#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 17434#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4)))) (= 0 |main_#t~mem19.offset|)), 17435#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 17436#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 17437#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 17438#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:08:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:16,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:08:16,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:08:16,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:08:16,869 INFO L87 Difference]: Start difference. First operand 267 states and 303 transitions. Second operand 25 states. [2018-02-02 10:08:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:18,179 INFO L93 Difference]: Finished difference Result 390 states and 438 transitions. [2018-02-02 10:08:18,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:08:18,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-02-02 10:08:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:18,180 INFO L225 Difference]: With dead ends: 390 [2018-02-02 10:08:18,180 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 10:08:18,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:08:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 10:08:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 265. [2018-02-02 10:08:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:08:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 300 transitions. [2018-02-02 10:08:18,183 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 300 transitions. Word has length 55 [2018-02-02 10:08:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:18,183 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 300 transitions. [2018-02-02 10:08:18,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:08:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 300 transitions. [2018-02-02 10:08:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:08:18,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:18,183 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:18,184 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -818315521, now seen corresponding path program 2 times [2018-02-02 10:08:18,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:18,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:18,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:18,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:08:18,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:18,335 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:08:18,335 INFO L182 omatonBuilderFactory]: Interpolants [18144#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 18145#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18146#(and (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)) (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 18147#(and (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18148#(and (not (= main_~p~0.base main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 18149#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18150#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18151#(and (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 18152#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 18153#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 18154#(= 2 |main_#t~mem20|), 18138#true, 18139#false, 18140#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 18141#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 18142#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 18143#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))] [2018-02-02 10:08:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:18,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:08:18,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:08:18,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:08:18,336 INFO L87 Difference]: Start difference. First operand 265 states and 300 transitions. Second operand 17 states. [2018-02-02 10:08:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:18,689 INFO L93 Difference]: Finished difference Result 361 states and 400 transitions. [2018-02-02 10:08:18,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:08:18,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-02 10:08:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:18,690 INFO L225 Difference]: With dead ends: 361 [2018-02-02 10:08:18,690 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 10:08:18,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:08:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 10:08:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 271. [2018-02-02 10:08:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 10:08:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2018-02-02 10:08:18,692 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 58 [2018-02-02 10:08:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:18,693 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2018-02-02 10:08:18,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:08:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2018-02-02 10:08:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:08:18,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:18,693 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:18,693 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1706040226, now seen corresponding path program 4 times [2018-02-02 10:08:18,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:18,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:19,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:19,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:19,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:19,127 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:08:19,127 INFO L182 omatonBuilderFactory]: Interpolants [18816#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 18817#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18818#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18819#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 18820#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 18821#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 18822#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 18823#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18824#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 18825#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 18826#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 18827#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) (+ 0 4)))) (= 0 |main_#t~mem22.offset|)), 18828#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 18829#(= 1 (select |#valid| |main_#t~mem22.base|)), 18830#(= 1 (select |#valid| main_~p~0.base)), 18807#true, 18808#false, 18809#(= 0 |main_#t~malloc0.offset|), 18810#(= 0 main_~a~0.offset), 18811#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 18812#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 18813#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 18814#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 18815#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:19,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:08:19,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:08:19,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:08:19,128 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand 24 states. [2018-02-02 10:08:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:20,114 INFO L93 Difference]: Finished difference Result 341 states and 381 transitions. [2018-02-02 10:08:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:08:20,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 10:08:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:20,115 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:08:20,115 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 10:08:20,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=391, Invalid=2059, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:08:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 10:08:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 276. [2018-02-02 10:08:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:08:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-02-02 10:08:20,119 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 58 [2018-02-02 10:08:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:20,119 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-02-02 10:08:20,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:08:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-02-02 10:08:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:08:20,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:20,120 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:20,120 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1706040227, now seen corresponding path program 3 times [2018-02-02 10:08:20,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:20,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:20,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:20,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:20,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:20,636 INFO L182 omatonBuilderFactory]: Interpolants [19520#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) (+ 0 4)))) (= 0 |main_#t~mem22.offset|)), 19521#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 19522#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 19523#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 19500#true, 19501#false, 19502#(= 0 |main_#t~malloc0.offset|), 19503#(= 0 main_~a~0.offset), 19504#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19505#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 19506#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 19507#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 19508#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 19509#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 19510#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19511#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19512#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 19513#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 19514#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 19515#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 19516#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19517#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 19518#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 19519#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))] [2018-02-02 10:08:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:20,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:08:20,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:08:20,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:08:20,637 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 24 states. [2018-02-02 10:08:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:21,723 INFO L93 Difference]: Finished difference Result 365 states and 406 transitions. [2018-02-02 10:08:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:08:21,723 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 10:08:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:21,724 INFO L225 Difference]: With dead ends: 365 [2018-02-02 10:08:21,724 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 10:08:21,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:08:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 10:08:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 276. [2018-02-02 10:08:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:08:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-02-02 10:08:21,726 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 58 [2018-02-02 10:08:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:21,727 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-02-02 10:08:21,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:08:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-02-02 10:08:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:08:21,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:21,727 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] [2018-02-02 10:08:21,727 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:21,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1390181717, now seen corresponding path program 1 times [2018-02-02 10:08:21,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:21,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:22,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:22,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:22,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:22,156 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:08:22,156 INFO L182 omatonBuilderFactory]: Interpolants [20224#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 20225#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 20226#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 20227#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20228#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 20229#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 20230#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 20231#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4)))) (= 0 |main_#t~mem19.offset|)), 20232#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 20233#(= 1 (select |#valid| |main_#t~mem22.base|)), 20234#(= 1 (select |#valid| main_~p~0.base)), 20211#true, 20212#false, 20213#(= 0 |main_#t~malloc0.offset|), 20214#(= 0 main_~a~0.offset), 20215#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20216#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20217#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20218#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 20219#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20220#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 20221#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20222#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 20223#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 10:08:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:22,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:08:22,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:08:22,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:08:22,157 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 24 states. [2018-02-02 10:08:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:23,182 INFO L93 Difference]: Finished difference Result 350 states and 391 transitions. [2018-02-02 10:08:23,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:08:23,183 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 10:08:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:23,183 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:08:23,183 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:08:23,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=375, Invalid=1977, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:08:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:08:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 281. [2018-02-02 10:08:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 10:08:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 317 transitions. [2018-02-02 10:08:23,186 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 317 transitions. Word has length 58 [2018-02-02 10:08:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:23,186 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 317 transitions. [2018-02-02 10:08:23,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:08:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 317 transitions. [2018-02-02 10:08:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:08:23,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:23,187 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] [2018-02-02 10:08:23,187 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1390181718, now seen corresponding path program 1 times [2018-02-02 10:08:23,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:23,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:23,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:23,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:23,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:23,870 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:08:23,870 INFO L182 omatonBuilderFactory]: Interpolants [20928#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 20929#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 20930#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 20931#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 20932#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20933#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 20934#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 20935#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 20936#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) (= 0 |main_#t~mem19.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4))))), 20937#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 20938#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 20939#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 20916#true, 20917#false, 20918#(= 0 |main_#t~malloc0.offset|), 20919#(= 0 main_~a~0.offset), 20920#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20921#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20922#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20923#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 20924#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20925#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 20926#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20927#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 10:08:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:23,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:08:23,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:08:23,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:08:23,870 INFO L87 Difference]: Start difference. First operand 281 states and 317 transitions. Second operand 24 states. [2018-02-02 10:08:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:25,080 INFO L93 Difference]: Finished difference Result 370 states and 412 transitions. [2018-02-02 10:08:25,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:08:25,080 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 10:08:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:25,081 INFO L225 Difference]: With dead ends: 370 [2018-02-02 10:08:25,081 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 10:08:25,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:08:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 10:08:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 276. [2018-02-02 10:08:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:08:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-02-02 10:08:25,083 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 58 [2018-02-02 10:08:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:25,083 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-02-02 10:08:25,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:08:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-02-02 10:08:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:08:25,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:25,084 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:25,084 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash 142984639, now seen corresponding path program 2 times [2018-02-02 10:08:25,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:25,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:25,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:25,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:25,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:25,359 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:08:25,359 INFO L182 omatonBuilderFactory]: Interpolants [21632#true, 21633#false, 21634#(= 0 |main_#t~malloc0.offset|), 21635#(= 0 main_~a~0.offset), 21636#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 21637#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 21638#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 21639#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 21640#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 21641#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1)), 21642#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 21643#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 21644#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 21645#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 21646#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 21647#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 21648#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))), 21649#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 21650#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 21651#(= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 21652#(= 1 (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 21653#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 21654#(= 1 |main_#t~mem17|)] [2018-02-02 10:08:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:25,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:08:25,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:08:25,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:08:25,360 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 23 states. [2018-02-02 10:08:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:26,353 INFO L93 Difference]: Finished difference Result 386 states and 432 transitions. [2018-02-02 10:08:26,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:08:26,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-02-02 10:08:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:26,354 INFO L225 Difference]: With dead ends: 386 [2018-02-02 10:08:26,354 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 10:08:26,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1799, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:08:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 10:08:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 276. [2018-02-02 10:08:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:08:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 310 transitions. [2018-02-02 10:08:26,357 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 310 transitions. Word has length 58 [2018-02-02 10:08:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:26,357 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 310 transitions. [2018-02-02 10:08:26,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:08:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 310 transitions. [2018-02-02 10:08:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:08:26,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:26,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:26,357 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash -144417938, now seen corresponding path program 1 times [2018-02-02 10:08:26,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:26,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:26,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:26,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:08:26,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:26,867 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:08:26,867 INFO L182 omatonBuilderFactory]: Interpolants [22368#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 22369#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 22370#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 22371#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 22372#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| |main_#t~malloc12.base| 0) main_~a~0.base 0) |old(#valid)|) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 22373#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| main_~t~0.base 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 22374#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base)), 22375#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 22376#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 22377#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) 4) 0) main_~a~0.base 0) |old(#valid)|) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 22378#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 22379#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base)), 22380#(and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 22381#(and (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 22382#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 22383#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (not (= 0 main_~p~0.base)) (= (store (store |#valid| main_~p~0.base 0) |main_#t~mem25.base| 0) |old(#valid)|) (not (= main_~p~0.base |main_#t~mem25.base|))), 22384#(and (or (not (= 0 main_~t~0.offset)) (not (= main_~t~0.base 0))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) main_~t~0.base 0)) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~p~0.base))), 22385#(and (or (not (= 0 main_~t~0.offset)) (not (= main_~t~0.base 0))) (= |old(#valid)| (store |#valid| main_~t~0.base 0))), 22386#(and (or (not (= 0 main_~p~0.offset)) (not (= main_~p~0.base 0))) (= (store |#valid| main_~p~0.base 0) |old(#valid)|)), 22365#true, 22366#false, 22367#(= |#valid| |old(#valid)|)] [2018-02-02 10:08:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:26,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:08:26,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:08:26,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:08:26,868 INFO L87 Difference]: Start difference. First operand 276 states and 310 transitions. Second operand 22 states. [2018-02-02 10:08:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:27,775 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-02-02 10:08:27,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:08:27,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-02-02 10:08:27,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:27,776 INFO L225 Difference]: With dead ends: 311 [2018-02-02 10:08:27,776 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 10:08:27,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:08:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 10:08:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 292. [2018-02-02 10:08:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 10:08:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 326 transitions. [2018-02-02 10:08:27,779 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 326 transitions. Word has length 59 [2018-02-02 10:08:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:27,779 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 326 transitions. [2018-02-02 10:08:27,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:08:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 326 transitions. [2018-02-02 10:08:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:08:27,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:27,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:27,780 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1154998709, now seen corresponding path program 1 times [2018-02-02 10:08:27,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:27,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:28,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:28,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:28,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:28,529 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:08:28,529 INFO L182 omatonBuilderFactory]: Interpolants [23040#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) |old(#valid)|)), 23041#(and (= 0 main_~a~0.offset) (or (and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))) (and (or (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) main_~p~0.offset) (not (= 1 main_~p~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))))), 23042#(and (= 0 main_~a~0.offset) (or (and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))))), 23043#(or (and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))) (not (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 23044#(or (not (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (and (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base)))), 23045#(or (not (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)))), 23046#(or (not (= 0 |main_#t~mem25.offset|)) (and (not (= |main_#t~mem25.base| 0)) (not (= 0 main_~p~0.base)) (= (store (store |#valid| main_~p~0.base 0) |main_#t~mem25.base| 0) |old(#valid)|) (not (= main_~p~0.base |main_#t~mem25.base|)))), 23047#(or (and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) main_~t~0.base 0)) (not (= 0 main_~p~0.base)) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~t~0.base 0))) (not (= 0 main_~t~0.offset))), 23048#(or (and (= |old(#valid)| (store |#valid| main_~t~0.base 0)) (not (= main_~t~0.base 0))) (not (= 0 main_~t~0.offset))), 23049#(or (not (= 0 main_~p~0.offset)) (and (= (store |#valid| main_~p~0.base 0) |old(#valid)|) (not (= main_~p~0.base 0)))), 23026#true, 23027#false, 23028#(= |#valid| |old(#valid)|), 23029#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 23030#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 23031#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 23032#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 23033#(and (= (store (store |#valid| main_~a~0.base 0) |main_#t~malloc5.base| 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base |main_#t~malloc5.base|))), 23034#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| main_~a~0.base 0) main_~t~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 23035#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 23036#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 main_~a~0.base))), 23037#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 23038#(and (= (store (store |#valid| main_~a~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 23039#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)))] [2018-02-02 10:08:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:28,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:08:28,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:08:28,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:08:28,530 INFO L87 Difference]: Start difference. First operand 292 states and 326 transitions. Second operand 24 states. [2018-02-02 10:08:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:29,628 INFO L93 Difference]: Finished difference Result 314 states and 349 transitions. [2018-02-02 10:08:29,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:08:29,629 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-02-02 10:08:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:29,629 INFO L225 Difference]: With dead ends: 314 [2018-02-02 10:08:29,629 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 10:08:29,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=1547, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:08:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 10:08:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 279. [2018-02-02 10:08:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 10:08:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 313 transitions. [2018-02-02 10:08:29,631 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 313 transitions. Word has length 59 [2018-02-02 10:08:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:29,631 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 313 transitions. [2018-02-02 10:08:29,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:08:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2018-02-02 10:08:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:08:29,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:29,632 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:29,632 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2026064103, now seen corresponding path program 5 times [2018-02-02 10:08:29,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:29,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:30,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:30,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:08:30,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:30,179 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:08:30,179 INFO L182 omatonBuilderFactory]: Interpolants [23681#true, 23682#false, 23683#(= 0 |main_#t~malloc0.offset|), 23684#(= 0 main_~a~0.offset), 23685#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 23686#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 23687#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 23688#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base)) (= main_~t~0.offset 0)), 23689#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 23690#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|) (= 1 (select |#valid| |main_#t~mem7.base|))), 23691#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 23692#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base))), 23693#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 23694#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 23695#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 23696#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 23697#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 23698#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 23699#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 23700#(and (= main_~p~0.offset 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 23701#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) 3) (= 0 |main_#t~mem19.offset|)), 23702#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)) (<= (+ main_~p~0.offset 1) 0)), 23703#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 23704#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 3), 23705#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 23706#(= |main_#t~mem17| 3)] [2018-02-02 10:08:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:30,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:08:30,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:08:30,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:08:30,179 INFO L87 Difference]: Start difference. First operand 279 states and 313 transitions. Second operand 26 states. [2018-02-02 10:08:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:31,431 INFO L93 Difference]: Finished difference Result 367 states and 403 transitions. [2018-02-02 10:08:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:08:31,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-02-02 10:08:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:31,432 INFO L225 Difference]: With dead ends: 367 [2018-02-02 10:08:31,432 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 10:08:31,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=2405, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:08:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 10:08:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 282. [2018-02-02 10:08:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 10:08:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 316 transitions. [2018-02-02 10:08:31,434 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 316 transitions. Word has length 60 [2018-02-02 10:08:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:31,435 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 316 transitions. [2018-02-02 10:08:31,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:08:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 316 transitions. [2018-02-02 10:08:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:08:31,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:31,435 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:31,435 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1901313657, now seen corresponding path program 3 times [2018-02-02 10:08:31,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:31,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:32,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:32,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:08:32,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:32,019 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:08:32,019 INFO L182 omatonBuilderFactory]: Interpolants [24410#true, 24411#false, 24412#(= |main_#t~malloc0.offset| 0), 24413#(= main_~a~0.offset 0), 24414#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 24415#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 24416#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 24417#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 24418#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 24419#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 24420#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 24421#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 24422#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 24423#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 24424#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 24425#(and (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 24426#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 24427#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 24428#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 24429#(and (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 24430#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 24431#(and (= 0 main_~a~0.offset) (or (and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))))), 24432#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 24433#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 24434#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem17| 3))), 24435#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 24436#(= 1 (select |#valid| |main_#t~mem19.base|)), 24437#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:08:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:32,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:08:32,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:08:32,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:08:32,019 INFO L87 Difference]: Start difference. First operand 282 states and 316 transitions. Second operand 28 states. [2018-02-02 10:08:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:33,363 INFO L93 Difference]: Finished difference Result 386 states and 426 transitions. [2018-02-02 10:08:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:08:33,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-02-02 10:08:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:33,364 INFO L225 Difference]: With dead ends: 386 [2018-02-02 10:08:33,364 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 10:08:33,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=655, Invalid=2885, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:08:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 10:08:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 303. [2018-02-02 10:08:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 10:08:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 340 transitions. [2018-02-02 10:08:33,367 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 340 transitions. Word has length 61 [2018-02-02 10:08:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:33,367 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 340 transitions. [2018-02-02 10:08:33,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:08:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 340 transitions. [2018-02-02 10:08:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:08:33,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:33,368 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:33,368 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1901313658, now seen corresponding path program 2 times [2018-02-02 10:08:33,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:33,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:33,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:33,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:08:33,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:33,952 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:08:33,952 INFO L182 omatonBuilderFactory]: Interpolants [25216#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 25217#(and (<= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 25218#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 25191#true, 25192#false, 25193#(= |main_#t~malloc0.offset| 0), 25194#(= main_~a~0.offset 0), 25195#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 25196#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25197#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 25198#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 25199#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25200#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 25201#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 25202#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 25203#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 25204#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 25205#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 25206#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 25207#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 25208#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 25209#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 25210#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 25211#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))), 25212#(or (and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 25213#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3)), 25214#(or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 25215#(or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem17| 3))] [2018-02-02 10:08:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:33,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:08:33,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:08:33,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:08:33,953 INFO L87 Difference]: Start difference. First operand 303 states and 340 transitions. Second operand 28 states. [2018-02-02 10:08:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:35,845 INFO L93 Difference]: Finished difference Result 420 states and 463 transitions. [2018-02-02 10:08:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:08:35,845 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-02-02 10:08:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:35,846 INFO L225 Difference]: With dead ends: 420 [2018-02-02 10:08:35,846 INFO L226 Difference]: Without dead ends: 420 [2018-02-02 10:08:35,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=676, Invalid=3484, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:08:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-02 10:08:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 301. [2018-02-02 10:08:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-02 10:08:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 337 transitions. [2018-02-02 10:08:35,849 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 337 transitions. Word has length 61 [2018-02-02 10:08:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:35,849 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 337 transitions. [2018-02-02 10:08:35,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:08:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 337 transitions. [2018-02-02 10:08:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:08:35,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:35,850 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:35,850 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1879726641, now seen corresponding path program 4 times [2018-02-02 10:08:35,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:35,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:36,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:36,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:08:36,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:36,153 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:08:36,154 INFO L182 omatonBuilderFactory]: Interpolants [26014#true, 26015#false, 26016#(= 0 |main_#t~malloc0.offset|), 26017#(= 0 main_~a~0.offset), 26018#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26019#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26020#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26021#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 26022#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26023#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 26024#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26025#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 26026#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 26027#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 26028#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 26029#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 26030#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 26031#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))), 26032#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 26033#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 26034#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 26035#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 26036#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 26037#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 26038#(= 1 (select |#valid| |main_#t~mem19.base|)), 26039#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:08:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:36,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:08:36,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:08:36,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:08:36,154 INFO L87 Difference]: Start difference. First operand 301 states and 337 transitions. Second operand 26 states. [2018-02-02 10:08:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:37,315 INFO L93 Difference]: Finished difference Result 443 states and 492 transitions. [2018-02-02 10:08:37,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:08:37,315 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 10:08:37,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:37,316 INFO L225 Difference]: With dead ends: 443 [2018-02-02 10:08:37,316 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 10:08:37,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=607, Invalid=2585, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:08:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 10:08:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 328. [2018-02-02 10:08:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 10:08:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 368 transitions. [2018-02-02 10:08:37,319 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 368 transitions. Word has length 61 [2018-02-02 10:08:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:37,319 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 368 transitions. [2018-02-02 10:08:37,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:08:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 368 transitions. [2018-02-02 10:08:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:08:37,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:37,320 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:37,320 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1879726640, now seen corresponding path program 3 times [2018-02-02 10:08:37,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:37,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:37,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:37,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:08:37,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:37,793 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:08:37,793 INFO L182 omatonBuilderFactory]: Interpolants [26880#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 26881#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26882#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 26883#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26884#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26885#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 26886#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 26887#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (<= 8 (select |#length| main_~p~0.base))), 26888#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 26889#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 26890#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 26891#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 26892#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 26893#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 26894#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26895#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 26896#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 26897#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 26898#(and (<= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 26899#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 26873#true, 26874#false, 26875#(= 0 |main_#t~malloc0.offset|), 26876#(= 0 main_~a~0.offset), 26877#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26878#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26879#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:37,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:08:37,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:08:37,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:08:37,793 INFO L87 Difference]: Start difference. First operand 328 states and 368 transitions. Second operand 27 states. [2018-02-02 10:08:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:39,335 INFO L93 Difference]: Finished difference Result 468 states and 520 transitions. [2018-02-02 10:08:39,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:08:39,336 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-02-02 10:08:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:39,336 INFO L225 Difference]: With dead ends: 468 [2018-02-02 10:08:39,336 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 10:08:39,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=507, Invalid=2799, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:08:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 10:08:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 328. [2018-02-02 10:08:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 10:08:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 368 transitions. [2018-02-02 10:08:39,339 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 368 transitions. Word has length 61 [2018-02-02 10:08:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:39,339 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 368 transitions. [2018-02-02 10:08:39,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:08:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 368 transitions. [2018-02-02 10:08:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:08:39,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:39,339 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:39,340 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1967458247, now seen corresponding path program 6 times [2018-02-02 10:08:39,340 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:39,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:39,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:39,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:08:39,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:39,634 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:08:39,634 INFO L182 omatonBuilderFactory]: Interpolants [27776#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 27777#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|))), 27778#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 27779#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 27780#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 27781#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 27782#(= 1 (select |#valid| |main_#t~mem19.base|)), 27783#(= 1 (select |#valid| main_~p~0.base)), 27758#true, 27759#false, 27760#(= 0 |main_#t~malloc0.offset|), 27761#(= 0 main_~a~0.offset), 27762#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 27763#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 27764#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 27765#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 27766#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 27767#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 27768#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 27769#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 27770#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 27771#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 27772#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|))), 27773#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 27774#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 27775#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base)))] [2018-02-02 10:08:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:39,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:08:39,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:08:39,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:08:39,635 INFO L87 Difference]: Start difference. First operand 328 states and 368 transitions. Second operand 26 states. [2018-02-02 10:08:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:40,501 INFO L93 Difference]: Finished difference Result 433 states and 481 transitions. [2018-02-02 10:08:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:08:40,501 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 10:08:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:40,502 INFO L225 Difference]: With dead ends: 433 [2018-02-02 10:08:40,502 INFO L226 Difference]: Without dead ends: 433 [2018-02-02 10:08:40,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=506, Invalid=2146, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:08:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-02 10:08:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 322. [2018-02-02 10:08:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 10:08:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 362 transitions. [2018-02-02 10:08:40,505 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 362 transitions. Word has length 61 [2018-02-02 10:08:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:40,505 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 362 transitions. [2018-02-02 10:08:40,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:08:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 362 transitions. [2018-02-02 10:08:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:08:40,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:40,505 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:40,505 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:40,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1967458246, now seen corresponding path program 4 times [2018-02-02 10:08:40,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:40,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:40,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:40,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:08:40,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:40,900 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:08:40,900 INFO L182 omatonBuilderFactory]: Interpolants [28608#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 28609#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 28610#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 28611#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 28612#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 28613#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 28614#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 28615#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 28616#(and (<= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 28617#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 28591#true, 28592#false, 28593#(= 0 |main_#t~malloc0.offset|), 28594#(= 0 main_~a~0.offset), 28595#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 28596#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 28597#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 28598#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 28599#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 28600#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 28601#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 28602#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 28603#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 28604#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 28605#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (<= 8 (select |#length| main_~p~0.base))), 28606#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 28607#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 10:08:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:40,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:08:40,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:08:40,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:08:40,901 INFO L87 Difference]: Start difference. First operand 322 states and 362 transitions. Second operand 27 states. [2018-02-02 10:08:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:42,223 INFO L93 Difference]: Finished difference Result 464 states and 515 transitions. [2018-02-02 10:08:42,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:08:42,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-02-02 10:08:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:42,224 INFO L225 Difference]: With dead ends: 464 [2018-02-02 10:08:42,224 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:08:42,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=499, Invalid=2693, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:08:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:08:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 322. [2018-02-02 10:08:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 10:08:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 362 transitions. [2018-02-02 10:08:42,227 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 362 transitions. Word has length 61 [2018-02-02 10:08:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:42,227 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 362 transitions. [2018-02-02 10:08:42,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:08:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 362 transitions. [2018-02-02 10:08:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:08:42,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:42,228 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:42,228 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:42,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1642792887, now seen corresponding path program 2 times [2018-02-02 10:08:42,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:42,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:42,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:42,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:08:42,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:42,447 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:08:42,447 INFO L182 omatonBuilderFactory]: Interpolants [29472#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 29473#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 29474#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 29475#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 29476#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 29477#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.base main_~a~0.base)), 29478#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 29479#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) (+ 0 4)))), 29480#(and (= 0 (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~t~0.base) (+ 0 4)))), 29481#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 29482#(or (and (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.base| 0)) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 29483#(or (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 29464#true, 29465#false, 29466#(= 0 |main_#t~malloc0.offset|), 29467#(= 0 main_~a~0.offset), 29468#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 29469#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 29470#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 29471#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:42,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:08:42,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:08:42,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:08:42,448 INFO L87 Difference]: Start difference. First operand 322 states and 362 transitions. Second operand 20 states. Received shutdown request... [2018-02-02 10:08:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:08:42,888 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:08:42,893 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:08:42,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:08:42 BoogieIcfgContainer [2018-02-02 10:08:42,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:08:42,894 INFO L168 Benchmark]: Toolchain (without parser) took 53668.24 ms. Allocated memory was 404.8 MB in the beginning and 1.2 GB in the end (delta: 749.7 MB). Free memory was 361.4 MB in the beginning and 651.3 MB in the end (delta: -289.8 MB). Peak memory consumption was 459.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:08:42,895 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 404.8 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:08:42,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.29 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 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:08:42,895 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 348.2 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:08:42,895 INFO L168 Benchmark]: RCFGBuilder took 320.49 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 317.8 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:08:42,896 INFO L168 Benchmark]: TraceAbstraction took 53148.20 ms. Allocated memory was 404.8 MB in the beginning and 1.2 GB in the end (delta: 749.7 MB). Free memory was 317.8 MB in the beginning and 651.3 MB in the end (delta: -333.5 MB). Peak memory consumption was 416.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:08:42,897 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 404.8 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.29 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.23 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 348.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 320.49 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 317.8 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53148.20 ms. Allocated memory was 404.8 MB in the beginning and 1.2 GB in the end (delta: 749.7 MB). Free memory was 317.8 MB in the beginning and 651.3 MB in the end (delta: -333.5 MB). Peak memory consumption was 416.3 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 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (322states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (217 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 35 error locations. TIMEOUT Result, 53.1s OverallTime, 55 OverallIterations, 4 TraceHistogramMax, 37.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4668 SDtfs, 20369 SDslu, 39616 SDs, 0 SdLazy, 43545 SolverSat, 3927 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1896 GetRequests, 104 SyntacticMatches, 23 SemanticMatches, 1769 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13984 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 79/777 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 54 MinimizatonAttempts, 4177 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 2622 NumberOfCodeBlocks, 2622 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2567 ConstructedInterpolants, 0 QuantifiedInterpolants, 2417451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 11 PerfectInterpolantSequences, 79/777 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/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-08-42-903.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-08-42-903.csv Completed graceful shutdown