java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:55:08,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:55:08,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:55:08,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:55:08,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:55:08,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:55:08,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:55:08,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:55:08,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:55:08,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:55:08,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:55:08,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:55:08,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:55:08,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:55:08,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:55:08,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:55:08,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:55:08,876 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:55:08,877 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:55:08,878 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:55:08,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:55:08,880 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:55:08,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:55:08,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:55:08,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:55:08,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:55:08,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:55:08,883 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:55:08,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:55:08,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:55:08,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:55:08,883 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:55:08,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:55:08,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:55:08,893 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:55:08,893 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:55:08,893 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:55:08,893 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:55:08,894 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:55:08,895 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:55:08,895 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:55:08,895 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:55:08,895 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:55:08,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:55:08,895 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:55:08,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:55:08,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:55:08,927 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:55:08,930 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:55:08,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:55:08,931 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:55:08,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:55:09,057 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:55:09,058 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:55:09,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:55:09,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:55:09,062 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:55:09,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09, skipping insertion in model container [2018-02-02 20:55:09,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,075 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:55:09,104 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:55:09,199 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:55:09,218 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:55:09,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09 WrapperNode [2018-02-02 20:55:09,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:55:09,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:55:09,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:55:09,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:55:09,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (1/1) ... [2018-02-02 20:55:09,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:55:09,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:55:09,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:55:09,257 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:55:09,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (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 20:55:09,297 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:55:09,297 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:55:09,297 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:55:09,297 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:55:09,298 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:55:09,298 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:55:09,298 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:55:09,298 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:55:09,298 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:55:09,298 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:55:09,691 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:55:09,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:55:09 BoogieIcfgContainer [2018-02-02 20:55:09,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:55:09,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:55:09,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:55:09,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:55:09,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:55:09" (1/3) ... [2018-02-02 20:55:09,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716aff6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:55:09, skipping insertion in model container [2018-02-02 20:55:09,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:55:09" (2/3) ... [2018-02-02 20:55:09,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716aff6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:55:09, skipping insertion in model container [2018-02-02 20:55:09,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:55:09" (3/3) ... [2018-02-02 20:55:09,698 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:55:09,705 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:55:09,714 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-02 20:55:09,743 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:55:09,744 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:55:09,744 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:55:09,744 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:55:09,744 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:55:09,744 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:55:09,744 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:55:09,744 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:55:09,745 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:55:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-02-02 20:55:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:55:09,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:09,764 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:09,764 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1406208534, now seen corresponding path program 1 times [2018-02-02 20:55:09,800 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:09,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:09,876 INFO 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 20:55:09,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:09,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:09,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:09,879 INFO 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 20:55:09,879 INFO L182 omatonBuilderFactory]: Interpolants [172#true, 173#false, 174#(= 1 (select |#valid| |main_#t~malloc0.base|)), 175#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 20:55:09,879 INFO 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 20:55:09,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:55:09,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:55:09,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:55:09,963 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2018-02-02 20:55:10,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:10,114 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-02-02 20:55:10,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:55:10,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:55:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:10,121 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:55:10,121 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:55:10,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:55:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:55:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2018-02-02 20:55:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 20:55:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-02-02 20:55:10,149 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 8 [2018-02-02 20:55:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:10,149 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-02-02 20:55:10,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:55:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-02-02 20:55:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:55:10,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:10,150 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:10,150 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1406208535, now seen corresponding path program 1 times [2018-02-02 20:55:10,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:10,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:10,222 INFO 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 20:55:10,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:10,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:10,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:10,223 INFO 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 20:55:10,223 INFO L182 omatonBuilderFactory]: Interpolants [522#true, 523#false, 524#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 525#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-02 20:55:10,224 INFO 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 20:55:10,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:55:10,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:55:10,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:55:10,226 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 4 states. [2018-02-02 20:55:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:10,331 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-02-02 20:55:10,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:55:10,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:55:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:10,333 INFO L225 Difference]: With dead ends: 167 [2018-02-02 20:55:10,333 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 20:55:10,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:55:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 20:55:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-02-02 20:55:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 20:55:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-02-02 20:55:10,343 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 8 [2018-02-02 20:55:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:10,343 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-02-02 20:55:10,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:55:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-02-02 20:55:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:55:10,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:10,344 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:10,344 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1461588635, now seen corresponding path program 1 times [2018-02-02 20:55:10,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:10,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:10,410 INFO 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 20:55:10,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:10,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:10,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:10,411 INFO 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 20:55:10,411 INFO L182 omatonBuilderFactory]: Interpolants [857#true, 858#false, 859#(= (select |#valid| main_~head~0.base) 1), 860#(= (select |#valid| main_~x~0.base) 1)] [2018-02-02 20:55:10,411 INFO 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 20:55:10,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:55:10,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:55:10,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:55:10,412 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 4 states. [2018-02-02 20:55:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:10,542 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2018-02-02 20:55:10,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:55:10,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:55:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:10,544 INFO L225 Difference]: With dead ends: 171 [2018-02-02 20:55:10,544 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 20:55:10,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:55:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 20:55:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2018-02-02 20:55:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:55:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-02-02 20:55:10,550 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 15 [2018-02-02 20:55:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:10,550 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-02-02 20:55:10,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:55:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-02-02 20:55:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:55:10,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:10,551 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:10,551 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1461588636, now seen corresponding path program 1 times [2018-02-02 20:55:10,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:10,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:10,627 INFO 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 20:55:10,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:10,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:55:10,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:10,628 INFO L182 omatonBuilderFactory]: Interpolants [1200#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 1201#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 1195#true, 1196#false, 1197#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1198#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 1199#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1))] [2018-02-02 20:55:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:10,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:55:10,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:55:10,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:55:10,629 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 7 states. [2018-02-02 20:55:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:10,852 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2018-02-02 20:55:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:55:10,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 20:55:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:10,853 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:55:10,853 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:55:10,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:55:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:55:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2018-02-02 20:55:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:55:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-02-02 20:55:10,859 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 15 [2018-02-02 20:55:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:10,859 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-02-02 20:55:10,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:55:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-02-02 20:55:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:55:10,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:10,859 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:10,859 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash -191427424, now seen corresponding path program 1 times [2018-02-02 20:55:10,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:10,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:10,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 20:55:10,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:10,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:55:10,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:10,930 INFO 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 20:55:10,930 INFO L182 omatonBuilderFactory]: Interpolants [1670#true, 1671#false, 1672#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1673#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1674#(= 1 (select |#valid| |main_#t~mem6.base|)), 1675#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:55:10,930 INFO 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 20:55:10,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:55:10,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:55:10,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:55:10,931 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 6 states. [2018-02-02 20:55:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:11,184 INFO L93 Difference]: Finished difference Result 409 states and 470 transitions. [2018-02-02 20:55:11,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:55:11,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 20:55:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:11,186 INFO L225 Difference]: With dead ends: 409 [2018-02-02 20:55:11,186 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 20:55:11,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:55:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 20:55:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 218. [2018-02-02 20:55:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:55:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2018-02-02 20:55:11,194 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 18 [2018-02-02 20:55:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:11,195 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2018-02-02 20:55:11,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:55:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2018-02-02 20:55:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:55:11,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:11,195 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:11,196 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash -191427423, now seen corresponding path program 1 times [2018-02-02 20:55:11,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:11,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:11,264 INFO 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 20:55:11,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:11,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:55:11,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:11,265 INFO 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 20:55:11,265 INFO L182 omatonBuilderFactory]: Interpolants [2310#true, 2311#false, 2312#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2313#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2314#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 2315#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 20:55:11,265 INFO 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 20:55:11,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:55:11,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:55:11,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:55:11,266 INFO L87 Difference]: Start difference. First operand 218 states and 251 transitions. Second operand 6 states. [2018-02-02 20:55:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:11,605 INFO L93 Difference]: Finished difference Result 398 states and 460 transitions. [2018-02-02 20:55:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:55:11,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 20:55:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:11,606 INFO L225 Difference]: With dead ends: 398 [2018-02-02 20:55:11,607 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 20:55:11,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:55:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 20:55:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 207. [2018-02-02 20:55:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 20:55:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2018-02-02 20:55:11,615 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 18 [2018-02-02 20:55:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:11,615 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2018-02-02 20:55:11,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:55:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2018-02-02 20:55:11,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:55:11,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:11,616 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] [2018-02-02 20:55:11,616 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2092077490, now seen corresponding path program 1 times [2018-02-02 20:55:11,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:11,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:11,648 INFO 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 20:55:11,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:11,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:11,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:11,649 INFO 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 20:55:11,649 INFO L182 omatonBuilderFactory]: Interpolants [2932#true, 2933#false, 2934#(= main_~marked~0 0)] [2018-02-02 20:55:11,649 INFO 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 20:55:11,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:55:11,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:55:11,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:55:11,650 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand 3 states. [2018-02-02 20:55:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:11,658 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2018-02-02 20:55:11,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:55:11,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-02 20:55:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:11,660 INFO L225 Difference]: With dead ends: 242 [2018-02-02 20:55:11,660 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 20:55:11,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:55:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 20:55:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 218. [2018-02-02 20:55:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:55:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2018-02-02 20:55:11,664 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 24 [2018-02-02 20:55:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:11,664 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2018-02-02 20:55:11,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:55:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2018-02-02 20:55:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:55:11,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:11,665 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:11,665 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash -252118467, now seen corresponding path program 1 times [2018-02-02 20:55:11,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:11,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:11,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:11,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:55:11,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:11,824 INFO 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 20:55:11,825 INFO L182 omatonBuilderFactory]: Interpolants [3395#true, 3396#false, 3397#(= 1 (select |#valid| main_~head~0.base)), 3398#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 3399#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 3400#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 3401#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 3402#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 3403#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 3404#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (= 0 main_~marked~0)), 3405#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3406#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3407#(= 1 (select |#valid| |main_#t~mem12.base|))] [2018-02-02 20:55:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:11,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:55:11,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:55:11,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:55:11,825 INFO L87 Difference]: Start difference. First operand 218 states and 251 transitions. Second operand 13 states. [2018-02-02 20:55:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:12,625 INFO L93 Difference]: Finished difference Result 456 states and 514 transitions. [2018-02-02 20:55:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:55:12,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 20:55:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:12,627 INFO L225 Difference]: With dead ends: 456 [2018-02-02 20:55:12,627 INFO L226 Difference]: Without dead ends: 456 [2018-02-02 20:55:12,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:55:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-02 20:55:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 244. [2018-02-02 20:55:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 20:55:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 282 transitions. [2018-02-02 20:55:12,632 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 282 transitions. Word has length 36 [2018-02-02 20:55:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:12,632 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 282 transitions. [2018-02-02 20:55:12,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:55:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 282 transitions. [2018-02-02 20:55:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:55:12,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:12,633 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:12,634 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:12,634 INFO L82 PathProgramCache]: Analyzing trace with hash -252118466, now seen corresponding path program 1 times [2018-02-02 20:55:12,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:12,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:12,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:12,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:55:12,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:12,826 INFO L182 omatonBuilderFactory]: Interpolants [4144#true, 4145#false, 4146#(= 1 (select |#valid| main_~head~0.base)), 4147#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4148#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4149#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 4150#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4151#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 4152#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 4153#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4154#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4155#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 20:55:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:12,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:55:12,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:55:12,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:55:12,827 INFO L87 Difference]: Start difference. First operand 244 states and 282 transitions. Second operand 12 states. [2018-02-02 20:55:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:13,451 INFO L93 Difference]: Finished difference Result 455 states and 508 transitions. [2018-02-02 20:55:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:55:13,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-02 20:55:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:13,458 INFO L225 Difference]: With dead ends: 455 [2018-02-02 20:55:13,458 INFO L226 Difference]: Without dead ends: 455 [2018-02-02 20:55:13,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:55:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-02 20:55:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 244. [2018-02-02 20:55:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 20:55:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 281 transitions. [2018-02-02 20:55:13,462 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 281 transitions. Word has length 36 [2018-02-02 20:55:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:13,462 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 281 transitions. [2018-02-02 20:55:13,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:55:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 281 transitions. [2018-02-02 20:55:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:55:13,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:13,463 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:13,463 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1873975739, now seen corresponding path program 1 times [2018-02-02 20:55:13,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:13,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:13,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:55:13,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:13,545 INFO 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 20:55:13,545 INFO L182 omatonBuilderFactory]: Interpolants [4880#(or |main_#t~short14| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 4881#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4882#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 4883#(not |main_#t~short19|), 4877#true, 4878#false, 4879#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem11.base|) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:55:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:55:13,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:55:13,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:55:13,546 INFO L87 Difference]: Start difference. First operand 244 states and 281 transitions. Second operand 7 states. [2018-02-02 20:55:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:13,703 INFO L93 Difference]: Finished difference Result 280 states and 321 transitions. [2018-02-02 20:55:13,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:55:13,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 20:55:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:13,704 INFO L225 Difference]: With dead ends: 280 [2018-02-02 20:55:13,704 INFO L226 Difference]: Without dead ends: 280 [2018-02-02 20:55:13,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:55:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-02 20:55:13,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-02-02 20:55:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 20:55:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2018-02-02 20:55:13,709 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 43 [2018-02-02 20:55:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:13,709 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2018-02-02 20:55:13,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:55:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2018-02-02 20:55:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:55:13,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:13,711 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:13,711 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1872128697, now seen corresponding path program 1 times [2018-02-02 20:55:13,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:13,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:13,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:13,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:13,745 INFO 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 20:55:13,745 INFO L182 omatonBuilderFactory]: Interpolants [5428#true, 5429#false, 5430#(= 1 (select |#valid| |main_#t~malloc22.base|)), 5431#(= 1 (select |#valid| main_~tmp~0.base))] [2018-02-02 20:55:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:55:13,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:55:13,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:55:13,746 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand 4 states. [2018-02-02 20:55:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:13,799 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2018-02-02 20:55:13,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:55:13,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 20:55:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:13,801 INFO L225 Difference]: With dead ends: 256 [2018-02-02 20:55:13,801 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 20:55:13,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:55:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 20:55:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2018-02-02 20:55:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 20:55:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 290 transitions. [2018-02-02 20:55:13,806 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 290 transitions. Word has length 43 [2018-02-02 20:55:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:13,807 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 290 transitions. [2018-02-02 20:55:13,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:55:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 290 transitions. [2018-02-02 20:55:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:55:13,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:13,808 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:13,808 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1872128696, now seen corresponding path program 1 times [2018-02-02 20:55:13,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:13,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:13,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:13,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:13,865 INFO 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 20:55:13,865 INFO L182 omatonBuilderFactory]: Interpolants [5943#true, 5944#false, 5945#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 5946#(and (= (select |#length| main_~tmp~0.base) 8) (= main_~tmp~0.offset 0))] [2018-02-02 20:55:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:55:13,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:55:13,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:55:13,866 INFO L87 Difference]: Start difference. First operand 253 states and 290 transitions. Second operand 4 states. [2018-02-02 20:55:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:13,934 INFO L93 Difference]: Finished difference Result 250 states and 284 transitions. [2018-02-02 20:55:13,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:55:13,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 20:55:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:13,936 INFO L225 Difference]: With dead ends: 250 [2018-02-02 20:55:13,936 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:55:13,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:55:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:55:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-02-02 20:55:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 20:55:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 284 transitions. [2018-02-02 20:55:13,940 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 284 transitions. Word has length 43 [2018-02-02 20:55:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:13,941 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 284 transitions. [2018-02-02 20:55:13,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:55:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 284 transitions. [2018-02-02 20:55:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:55:13,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:13,942 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] [2018-02-02 20:55:13,942 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash -794533459, now seen corresponding path program 1 times [2018-02-02 20:55:13,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:13,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:13,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:13,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:13,966 INFO 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 20:55:13,966 INFO L182 omatonBuilderFactory]: Interpolants [6449#true, 6450#false, 6451#(not |main_#t~short14|)] [2018-02-02 20:55:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:13,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:55:13,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:55:13,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:55:13,967 INFO L87 Difference]: Start difference. First operand 250 states and 284 transitions. Second operand 3 states. [2018-02-02 20:55:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:13,973 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2018-02-02 20:55:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:55:13,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-02-02 20:55:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:13,974 INFO L225 Difference]: With dead ends: 250 [2018-02-02 20:55:13,974 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:55:13,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:55:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:55:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-02-02 20:55:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 20:55:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 282 transitions. [2018-02-02 20:55:13,978 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 282 transitions. Word has length 43 [2018-02-02 20:55:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:13,978 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 282 transitions. [2018-02-02 20:55:13,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:55:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 282 transitions. [2018-02-02 20:55:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:55:13,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:13,979 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:13,979 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:13,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1865614704, now seen corresponding path program 1 times [2018-02-02 20:55:13,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:13,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:14,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:14,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:55:14,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:14,197 INFO 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 20:55:14,198 INFO L182 omatonBuilderFactory]: Interpolants [6952#true, 6953#false, 6954#(= 1 (select |#valid| main_~head~0.base)), 6955#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 6956#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 6957#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 6958#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6959#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 6960#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 6961#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 6962#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 6963#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6964#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6965#(and (<= 0 |main_#t~mem16.offset|) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|))), 6966#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:55:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:14,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:55:14,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:55:14,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:55:14,199 INFO L87 Difference]: Start difference. First operand 250 states and 282 transitions. Second operand 15 states. [2018-02-02 20:55:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:15,148 INFO L93 Difference]: Finished difference Result 488 states and 547 transitions. [2018-02-02 20:55:15,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:55:15,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-02 20:55:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:15,149 INFO L225 Difference]: With dead ends: 488 [2018-02-02 20:55:15,149 INFO L226 Difference]: Without dead ends: 488 [2018-02-02 20:55:15,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:55:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-02-02 20:55:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 274. [2018-02-02 20:55:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 20:55:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 314 transitions. [2018-02-02 20:55:15,153 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 314 transitions. Word has length 46 [2018-02-02 20:55:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:15,153 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 314 transitions. [2018-02-02 20:55:15,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:55:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 314 transitions. [2018-02-02 20:55:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:55:15,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:15,153 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:15,154 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1865614705, now seen corresponding path program 1 times [2018-02-02 20:55:15,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:15,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:15,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:15,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:55:15,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:15,205 INFO L182 omatonBuilderFactory]: Interpolants [7776#(= 1 (select |#valid| main_~x~0.base)), 7771#true, 7772#false, 7773#(= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 7774#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7775#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 20:55:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:15,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:55:15,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:55:15,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:55:15,206 INFO L87 Difference]: Start difference. First operand 274 states and 314 transitions. Second operand 6 states. [2018-02-02 20:55:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:15,405 INFO L93 Difference]: Finished difference Result 298 states and 339 transitions. [2018-02-02 20:55:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:55:15,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-02-02 20:55:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:15,406 INFO L225 Difference]: With dead ends: 298 [2018-02-02 20:55:15,406 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 20:55:15,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:55:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 20:55:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 273. [2018-02-02 20:55:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 20:55:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 312 transitions. [2018-02-02 20:55:15,411 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 312 transitions. Word has length 46 [2018-02-02 20:55:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:15,411 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 312 transitions. [2018-02-02 20:55:15,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:55:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 312 transitions. [2018-02-02 20:55:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:55:15,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:15,412 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:15,412 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:15,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1101465968, now seen corresponding path program 1 times [2018-02-02 20:55:15,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:15,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:15,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:15,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:55:15,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:15,449 INFO 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 20:55:15,449 INFO L182 omatonBuilderFactory]: Interpolants [8356#true, 8357#false, 8358#(= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 8359#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8360#(= 1 (select |#valid| |main_#t~mem20.base|)), 8361#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:55:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:15,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:55:15,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:55:15,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:55:15,450 INFO L87 Difference]: Start difference. First operand 273 states and 312 transitions. Second operand 6 states. [2018-02-02 20:55:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:15,662 INFO L93 Difference]: Finished difference Result 301 states and 342 transitions. [2018-02-02 20:55:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:55:15,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-02 20:55:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:15,664 INFO L225 Difference]: With dead ends: 301 [2018-02-02 20:55:15,664 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 20:55:15,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:55:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 20:55:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 282. [2018-02-02 20:55:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 20:55:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 326 transitions. [2018-02-02 20:55:15,669 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 326 transitions. Word has length 47 [2018-02-02 20:55:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:15,669 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 326 transitions. [2018-02-02 20:55:15,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:55:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 326 transitions. [2018-02-02 20:55:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:55:15,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:15,670 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:15,670 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1101465967, now seen corresponding path program 1 times [2018-02-02 20:55:15,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:15,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:15,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:15,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:55:15,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:15,895 INFO 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 20:55:15,895 INFO L182 omatonBuilderFactory]: Interpolants [8960#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 8961#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 8962#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 8963#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 8964#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8965#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8966#(and (<= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|))), 8967#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 8953#true, 8954#false, 8955#(= 1 (select |#valid| main_~head~0.base)), 8956#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 8957#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 8958#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 8959#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:55:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:15,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:55:15,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:55:15,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:55:15,896 INFO L87 Difference]: Start difference. First operand 282 states and 326 transitions. Second operand 15 states. [2018-02-02 20:55:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:16,778 INFO L93 Difference]: Finished difference Result 505 states and 577 transitions. [2018-02-02 20:55:16,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:55:16,816 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-02-02 20:55:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:16,817 INFO L225 Difference]: With dead ends: 505 [2018-02-02 20:55:16,817 INFO L226 Difference]: Without dead ends: 505 [2018-02-02 20:55:16,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:55:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-02 20:55:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 299. [2018-02-02 20:55:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 20:55:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 347 transitions. [2018-02-02 20:55:16,821 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 347 transitions. Word has length 47 [2018-02-02 20:55:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:16,821 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 347 transitions. [2018-02-02 20:55:16,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:55:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 347 transitions. [2018-02-02 20:55:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:55:16,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:16,822 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:16,822 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash -402134456, now seen corresponding path program 2 times [2018-02-02 20:55:16,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:16,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:17,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:17,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:55:17,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:17,046 INFO 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 20:55:17,046 INFO L182 omatonBuilderFactory]: Interpolants [9824#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 9825#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem6.base| main_~head~0.base))), 9826#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 9827#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 9828#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9829#(= 1 (select |#valid| |main_#t~mem12.base|)), 9812#true, 9813#false, 9814#(= 1 (select |#valid| main_~head~0.base)), 9815#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 9816#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 9817#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9818#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|))), 9819#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 9820#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))) (= 0 main_~marked~0)), 9821#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 9822#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 9823#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)))] [2018-02-02 20:55:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:17,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:55:17,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:55:17,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:55:17,047 INFO L87 Difference]: Start difference. First operand 299 states and 347 transitions. Second operand 18 states. [2018-02-02 20:55:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:18,077 INFO L93 Difference]: Finished difference Result 632 states and 723 transitions. [2018-02-02 20:55:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:55:18,078 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 20:55:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:18,079 INFO L225 Difference]: With dead ends: 632 [2018-02-02 20:55:18,079 INFO L226 Difference]: Without dead ends: 632 [2018-02-02 20:55:18,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:55:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-02-02 20:55:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 334. [2018-02-02 20:55:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 20:55:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 387 transitions. [2018-02-02 20:55:18,084 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 387 transitions. Word has length 48 [2018-02-02 20:55:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:18,084 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 387 transitions. [2018-02-02 20:55:18,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:55:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 387 transitions. [2018-02-02 20:55:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:55:18,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:18,084 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:18,084 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash -402134455, now seen corresponding path program 2 times [2018-02-02 20:55:18,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:18,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:18,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:18,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:55:18,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:18,390 INFO 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 20:55:18,390 INFO L182 omatonBuilderFactory]: Interpolants [10852#true, 10853#false, 10854#(= 1 (select |#valid| main_~head~0.base)), 10855#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 10856#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 10857#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10858#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10859#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 10860#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10861#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 10862#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 10863#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10864#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 10865#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10866#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10867#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 10868#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10869#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10870#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 20:55:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:18,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:55:18,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:55:18,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:55:18,390 INFO L87 Difference]: Start difference. First operand 334 states and 387 transitions. Second operand 19 states. [2018-02-02 20:55:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:19,518 INFO L93 Difference]: Finished difference Result 584 states and 671 transitions. [2018-02-02 20:55:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:55:19,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 20:55:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:19,519 INFO L225 Difference]: With dead ends: 584 [2018-02-02 20:55:19,519 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 20:55:19,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=1216, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:55:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 20:55:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 334. [2018-02-02 20:55:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 20:55:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 386 transitions. [2018-02-02 20:55:19,523 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 386 transitions. Word has length 48 [2018-02-02 20:55:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:19,523 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 386 transitions. [2018-02-02 20:55:19,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:55:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 386 transitions. [2018-02-02 20:55:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:55:19,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:19,524 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 20:55:19,524 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash 364321685, now seen corresponding path program 1 times [2018-02-02 20:55:19,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:19,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:19,791 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 20:55:19,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:19,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:55:19,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:19,792 INFO 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 20:55:19,792 INFO L182 omatonBuilderFactory]: Interpolants [11840#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~marked~0)), 11841#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11842#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 11843#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 11844#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11845#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 11846#(not |main_#t~short14|), 11831#true, 11832#false, 11833#(= 1 (select |#valid| main_~head~0.base)), 11834#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 11835#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 11836#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 11837#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11838#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 11839#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:55:19,792 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 20:55:19,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:55:19,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:55:19,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:55:19,792 INFO L87 Difference]: Start difference. First operand 334 states and 386 transitions. Second operand 16 states. [2018-02-02 20:55:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:20,719 INFO L93 Difference]: Finished difference Result 462 states and 523 transitions. [2018-02-02 20:55:20,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:55:20,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-02-02 20:55:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:20,721 INFO L225 Difference]: With dead ends: 462 [2018-02-02 20:55:20,721 INFO L226 Difference]: Without dead ends: 462 [2018-02-02 20:55:20,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:55:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-02 20:55:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 325. [2018-02-02 20:55:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 20:55:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 371 transitions. [2018-02-02 20:55:20,726 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 371 transitions. Word has length 50 [2018-02-02 20:55:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:20,726 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 371 transitions. [2018-02-02 20:55:20,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:55:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 371 transitions. [2018-02-02 20:55:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:55:20,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:20,727 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-02 20:55:20,728 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1338693313, now seen corresponding path program 1 times [2018-02-02 20:55:20,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:20,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:20,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:20,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:55:20,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:20,967 INFO 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 20:55:20,967 INFO L182 omatonBuilderFactory]: Interpolants [12678#true, 12679#false, 12680#(= 1 (select |#valid| main_~head~0.base)), 12681#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 12682#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 12683#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12684#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 12685#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 12686#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12687#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~marked~0)), 12688#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12689#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 12690#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 12691#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12692#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 12693#(not |main_#t~short19|)] [2018-02-02 20:55:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:20,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:55:20,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:55:20,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:55:20,968 INFO L87 Difference]: Start difference. First operand 325 states and 371 transitions. Second operand 16 states. [2018-02-02 20:55:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:21,931 INFO L93 Difference]: Finished difference Result 440 states and 497 transitions. [2018-02-02 20:55:21,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:55:21,932 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 20:55:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:21,933 INFO L225 Difference]: With dead ends: 440 [2018-02-02 20:55:21,933 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 20:55:21,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:55:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 20:55:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 319. [2018-02-02 20:55:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-02 20:55:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 363 transitions. [2018-02-02 20:55:21,937 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 363 transitions. Word has length 58 [2018-02-02 20:55:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:21,937 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 363 transitions. [2018-02-02 20:55:21,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:55:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 363 transitions. [2018-02-02 20:55:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:55:21,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:21,938 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:21,938 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1539545307, now seen corresponding path program 2 times [2018-02-02 20:55:21,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:21,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:22,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:22,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:55:22,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:22,178 INFO 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 20:55:22,178 INFO L182 omatonBuilderFactory]: Interpolants [13504#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 13505#(or (and (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 13506#(and (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13507#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13508#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 13509#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13510#(and (not (= |main_#t~mem6.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13511#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 13512#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 13513#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 13514#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13515#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13516#(and (<= 0 |main_#t~mem16.offset|) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|))), 13517#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 13497#true, 13498#false, 13499#(= 1 (select |#valid| main_~head~0.base)), 13500#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 13501#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 13502#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 13503#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:55:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:22,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:55:22,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:55:22,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:55:22,179 INFO L87 Difference]: Start difference. First operand 319 states and 363 transitions. Second operand 21 states. [2018-02-02 20:55:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:23,153 INFO L93 Difference]: Finished difference Result 418 states and 470 transitions. [2018-02-02 20:55:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:55:23,153 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-02 20:55:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:23,154 INFO L225 Difference]: With dead ends: 418 [2018-02-02 20:55:23,154 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 20:55:23,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=1521, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:55:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 20:55:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 338. [2018-02-02 20:55:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 20:55:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 386 transitions. [2018-02-02 20:55:23,159 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 386 transitions. Word has length 58 [2018-02-02 20:55:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:23,160 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 386 transitions. [2018-02-02 20:55:23,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:55:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 386 transitions. [2018-02-02 20:55:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:55:23,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:23,160 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:23,161 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1100381793, now seen corresponding path program 1 times [2018-02-02 20:55:23,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:23,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:23,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:23,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:55:23,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:23,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 20:55:23,447 INFO L182 omatonBuilderFactory]: Interpolants [14320#true, 14321#false, 14322#(= 1 (select |#valid| main_~head~0.base)), 14323#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 14324#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 14325#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 14326#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14327#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 14328#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 14329#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14330#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14331#(and (= |main_#t~mem12.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select |#length| |main_#t~mem12.base|)) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem12.base|))), 14332#(and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 14333#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= |main_#t~mem20.offset| 0)), 14334#(and (<= main_~x~0.offset 0) (= 8 (select |#length| main_~x~0.base))), 14335#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)) (= 8 (select |#length| main_~x~0.base)))] [2018-02-02 20:55:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:23,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:55:23,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:55:23,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:55:23,448 INFO L87 Difference]: Start difference. First operand 338 states and 386 transitions. Second operand 16 states. [2018-02-02 20:55:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:24,192 INFO L93 Difference]: Finished difference Result 445 states and 498 transitions. [2018-02-02 20:55:24,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:55:24,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-02 20:55:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:24,193 INFO L225 Difference]: With dead ends: 445 [2018-02-02 20:55:24,193 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 20:55:24,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:55:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 20:55:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 338. [2018-02-02 20:55:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 20:55:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 386 transitions. [2018-02-02 20:55:24,196 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 386 transitions. Word has length 59 [2018-02-02 20:55:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:24,197 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 386 transitions. [2018-02-02 20:55:24,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:55:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 386 transitions. [2018-02-02 20:55:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:55:24,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:24,197 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:24,197 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:24,197 INFO L82 PathProgramCache]: Analyzing trace with hash -567323661, now seen corresponding path program 1 times [2018-02-02 20:55:24,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:24,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:24,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:24,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:55:24,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:24,433 INFO 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 20:55:24,434 INFO L182 omatonBuilderFactory]: Interpolants [15149#true, 15150#false, 15151#(= 1 (select |#valid| main_~head~0.base)), 15152#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 15153#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 15154#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 15155#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15156#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 15157#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 15158#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15159#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 15160#(and (= |main_#t~mem12.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select |#length| |main_#t~mem12.base|)) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem12.base|))), 15161#(and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15162#(and (<= |main_#t~mem16.offset| 0) (= 8 (select |#length| |main_#t~mem16.base|))), 15163#(and (<= main_~x~0.offset 0) (= 8 (select |#length| main_~x~0.base))), 15164#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)) (= 8 (select |#length| main_~x~0.base)))] [2018-02-02 20:55:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:24,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:55:24,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:55:24,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:55:24,434 INFO L87 Difference]: Start difference. First operand 338 states and 386 transitions. Second operand 16 states. [2018-02-02 20:55:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:25,178 INFO L93 Difference]: Finished difference Result 453 states and 507 transitions. [2018-02-02 20:55:25,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:55:25,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-02 20:55:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:25,179 INFO L225 Difference]: With dead ends: 453 [2018-02-02 20:55:25,179 INFO L226 Difference]: Without dead ends: 453 [2018-02-02 20:55:25,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:55:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-02 20:55:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 338. [2018-02-02 20:55:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 20:55:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 386 transitions. [2018-02-02 20:55:25,182 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 386 transitions. Word has length 59 [2018-02-02 20:55:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:25,182 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 386 transitions. [2018-02-02 20:55:25,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:55:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 386 transitions. [2018-02-02 20:55:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:55:25,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:25,183 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:25,183 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 497669479, now seen corresponding path program 1 times [2018-02-02 20:55:25,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:25,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:25,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:25,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:55:25,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:25,221 INFO 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 20:55:25,221 INFO L182 omatonBuilderFactory]: Interpolants [15986#true, 15987#false, 15988#(not (= 0 |main_#t~malloc0.base|)), 15989#(not (= 0 main_~head~0.base)), 15990#(not (= 0 main_~x~0.base))] [2018-02-02 20:55:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:25,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:55:25,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:55:25,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:55:25,222 INFO L87 Difference]: Start difference. First operand 338 states and 386 transitions. Second operand 5 states. [2018-02-02 20:55:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:25,304 INFO L93 Difference]: Finished difference Result 367 states and 412 transitions. [2018-02-02 20:55:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:55:25,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-02-02 20:55:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:25,305 INFO L225 Difference]: With dead ends: 367 [2018-02-02 20:55:25,305 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 20:55:25,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:55:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 20:55:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 338. [2018-02-02 20:55:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 20:55:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 384 transitions. [2018-02-02 20:55:25,308 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 384 transitions. Word has length 59 [2018-02-02 20:55:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:25,308 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 384 transitions. [2018-02-02 20:55:25,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:55:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 384 transitions. [2018-02-02 20:55:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:55:25,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:25,309 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:25,309 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1379279270, now seen corresponding path program 2 times [2018-02-02 20:55:25,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:25,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:55:25,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:25,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:55:25,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:25,428 INFO 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 20:55:25,428 INFO L182 omatonBuilderFactory]: Interpolants [16704#(and (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|)) (<= 0 (+ |main_#t~mem20.offset| 4))), 16705#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 4))), 16700#true, 16701#false, 16702#(and (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 16703#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4)))] [2018-02-02 20:55:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:55:25,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:55:25,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:55:25,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:55:25,429 INFO L87 Difference]: Start difference. First operand 338 states and 384 transitions. Second operand 6 states. [2018-02-02 20:55:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:25,614 INFO L93 Difference]: Finished difference Result 357 states and 398 transitions. [2018-02-02 20:55:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:55:25,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-02-02 20:55:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:25,615 INFO L225 Difference]: With dead ends: 357 [2018-02-02 20:55:25,615 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 20:55:25,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:55:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 20:55:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 336. [2018-02-02 20:55:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 20:55:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 379 transitions. [2018-02-02 20:55:25,617 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 379 transitions. Word has length 59 [2018-02-02 20:55:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:25,617 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 379 transitions. [2018-02-02 20:55:25,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:55:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 379 transitions. [2018-02-02 20:55:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:55:25,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:25,618 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:25,618 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash -808443437, now seen corresponding path program 3 times [2018-02-02 20:55:25,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:25,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:25,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:25,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:55:25,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:25,968 INFO 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 20:55:25,969 INFO L182 omatonBuilderFactory]: Interpolants [17408#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 17409#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 17410#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17411#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 17412#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 17413#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))) (= 0 main_~marked~0)), 17414#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 17415#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 17416#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 17417#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 17418#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 17419#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17420#(and (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 17421#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 17422#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 17423#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17424#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17425#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 17426#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17427#(= 1 (select |#valid| |main_#t~mem12.base|)), 17405#true, 17406#false, 17407#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 20:55:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:25,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:55:25,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:55:25,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:55:25,969 INFO L87 Difference]: Start difference. First operand 336 states and 379 transitions. Second operand 23 states. [2018-02-02 20:55:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:27,249 INFO L93 Difference]: Finished difference Result 445 states and 494 transitions. [2018-02-02 20:55:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:55:27,250 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-02-02 20:55:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:27,251 INFO L225 Difference]: With dead ends: 445 [2018-02-02 20:55:27,251 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 20:55:27,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=497, Invalid=2155, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:55:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 20:55:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 336. [2018-02-02 20:55:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 20:55:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 378 transitions. [2018-02-02 20:55:27,255 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 378 transitions. Word has length 60 [2018-02-02 20:55:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:27,255 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 378 transitions. [2018-02-02 20:55:27,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:55:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 378 transitions. [2018-02-02 20:55:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:55:27,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:27,256 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:27,256 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash -808443436, now seen corresponding path program 3 times [2018-02-02 20:55:27,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:27,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:27,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:27,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:55:27,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:27,885 INFO 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 20:55:27,885 INFO L182 omatonBuilderFactory]: Interpolants [18267#true, 18268#false, 18269#(= |main_#t~malloc0.offset| 0), 18270#(= main_~head~0.offset 0), 18271#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 18272#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 18273#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 18274#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 18275#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 18276#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 18277#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18278#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 18279#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 18280#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18281#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0)), 18282#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 18283#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem6.base| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18284#(and (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 18285#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))), 18286#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18287#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 18288#(and (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))), 18289#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 18290#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18291#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18292#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem11.base| 0)))), 18293#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not |main_#t~short14|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18294#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18295#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 20:55:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:27,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:55:27,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:55:27,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:55:27,886 INFO L87 Difference]: Start difference. First operand 336 states and 378 transitions. Second operand 29 states. [2018-02-02 20:55:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:30,579 INFO L93 Difference]: Finished difference Result 436 states and 483 transitions. [2018-02-02 20:55:30,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:55:30,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-02-02 20:55:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:30,580 INFO L225 Difference]: With dead ends: 436 [2018-02-02 20:55:30,580 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 20:55:30,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1070, Invalid=4186, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:55:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 20:55:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 301. [2018-02-02 20:55:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-02 20:55:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 338 transitions. [2018-02-02 20:55:30,583 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 338 transitions. Word has length 60 [2018-02-02 20:55:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:30,584 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 338 transitions. [2018-02-02 20:55:30,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:55:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 338 transitions. [2018-02-02 20:55:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:55:30,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:30,584 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:30,584 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash 743414880, now seen corresponding path program 2 times [2018-02-02 20:55:30,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:30,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:30,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:30,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:55:30,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:30,808 INFO 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 20:55:30,808 INFO L182 omatonBuilderFactory]: Interpolants [19136#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 19137#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 19138#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19139#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 19140#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 19141#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 19142#(= 1 (select |#valid| |main_#t~mem12.base|)), 19121#true, 19122#false, 19123#(= 1 (select |#valid| main_~head~0.base)), 19124#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 19125#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 19126#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19127#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 19128#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 19129#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 19130#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 19131#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 19132#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 19133#(and (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 19134#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 19135#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 20:55:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:30,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:55:30,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:55:30,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:55:30,809 INFO L87 Difference]: Start difference. First operand 301 states and 338 transitions. Second operand 22 states. [2018-02-02 20:55:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:32,327 INFO L93 Difference]: Finished difference Result 557 states and 623 transitions. [2018-02-02 20:55:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:55:32,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-02-02 20:55:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:32,329 INFO L225 Difference]: With dead ends: 557 [2018-02-02 20:55:32,329 INFO L226 Difference]: Without dead ends: 557 [2018-02-02 20:55:32,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=376, Invalid=2486, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:55:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-02 20:55:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 350. [2018-02-02 20:55:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 20:55:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 394 transitions. [2018-02-02 20:55:32,332 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 394 transitions. Word has length 62 [2018-02-02 20:55:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:32,332 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 394 transitions. [2018-02-02 20:55:32,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:55:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 394 transitions. [2018-02-02 20:55:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:55:32,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:32,333 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:32,333 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash 743414881, now seen corresponding path program 1 times [2018-02-02 20:55:32,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:32,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:32,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:32,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:55:32,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:32,724 INFO 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 20:55:32,725 INFO L182 omatonBuilderFactory]: Interpolants [20128#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 20129#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 20130#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 20131#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 20132#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 20133#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 20134#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8)), 20114#true, 20115#false, 20116#(= 1 (select |#valid| main_~head~0.base)), 20117#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 20118#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 20119#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20120#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20121#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20122#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20123#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 20124#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 20125#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 20126#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 20127#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 20:55:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:32,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:55:32,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:55:32,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:55:32,725 INFO L87 Difference]: Start difference. First operand 350 states and 394 transitions. Second operand 21 states. [2018-02-02 20:55:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:34,144 INFO L93 Difference]: Finished difference Result 556 states and 622 transitions. [2018-02-02 20:55:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:55:34,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-02-02 20:55:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:34,146 INFO L225 Difference]: With dead ends: 556 [2018-02-02 20:55:34,146 INFO L226 Difference]: Without dead ends: 556 [2018-02-02 20:55:34,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=1662, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:55:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-02-02 20:55:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 350. [2018-02-02 20:55:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 20:55:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 393 transitions. [2018-02-02 20:55:34,149 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 393 transitions. Word has length 62 [2018-02-02 20:55:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:34,149 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 393 transitions. [2018-02-02 20:55:34,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:55:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 393 transitions. [2018-02-02 20:55:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:55:34,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:34,150 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:34,150 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash 563139372, now seen corresponding path program 1 times [2018-02-02 20:55:34,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:34,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:34,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:34,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:55:34,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:34,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 20:55:34,447 INFO L182 omatonBuilderFactory]: Interpolants [21089#true, 21090#false, 21091#(= 1 (select |#valid| main_~head~0.base)), 21092#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 21093#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 21094#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21095#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21096#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 21097#(or (and (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 21098#(and (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21099#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21100#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 21101#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21102#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21103#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 21104#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 21105#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 21106#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 21107#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 21108#(<= 0 |main_#t~mem20.offset|), 21109#(<= 0 main_~x~0.offset), 21110#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:55:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:34,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:55:34,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:55:34,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:55:34,448 INFO L87 Difference]: Start difference. First operand 350 states and 393 transitions. Second operand 22 states. [2018-02-02 20:55:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:35,632 INFO L93 Difference]: Finished difference Result 460 states and 511 transitions. [2018-02-02 20:55:35,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:55:35,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-02-02 20:55:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:35,633 INFO L225 Difference]: With dead ends: 460 [2018-02-02 20:55:35,633 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 20:55:35,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=581, Invalid=2389, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:55:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 20:55:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 358. [2018-02-02 20:55:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 20:55:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2018-02-02 20:55:35,636 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 63 [2018-02-02 20:55:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:35,636 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2018-02-02 20:55:35,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:55:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2018-02-02 20:55:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:55:35,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:35,637 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:35,637 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash 735867446, now seen corresponding path program 1 times [2018-02-02 20:55:35,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:35,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:35,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:35,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:55:35,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:35,662 INFO 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 20:55:35,662 INFO L182 omatonBuilderFactory]: Interpolants [21995#true, 21996#false, 21997#(not |main_#t~short31|)] [2018-02-02 20:55:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:35,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:55:35,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:55:35,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:55:35,663 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand 3 states. [2018-02-02 20:55:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:35,666 INFO L93 Difference]: Finished difference Result 356 states and 400 transitions. [2018-02-02 20:55:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:55:35,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-02-02 20:55:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:35,667 INFO L225 Difference]: With dead ends: 356 [2018-02-02 20:55:35,667 INFO L226 Difference]: Without dead ends: 356 [2018-02-02 20:55:35,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:55:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-02 20:55:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-02-02 20:55:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-02 20:55:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 400 transitions. [2018-02-02 20:55:35,670 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 400 transitions. Word has length 67 [2018-02-02 20:55:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:35,670 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 400 transitions. [2018-02-02 20:55:35,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:55:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 400 transitions. [2018-02-02 20:55:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:55:35,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:35,670 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:35,670 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -427409840, now seen corresponding path program 1 times [2018-02-02 20:55:35,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:35,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:55:35,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:55:35,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:55:35,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:35,706 INFO 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 20:55:35,706 INFO L182 omatonBuilderFactory]: Interpolants [22710#true, 22711#false, 22712#(not (= 0 |main_#t~malloc0.base|)), 22713#(not (= 0 main_~head~0.base)), 22714#(not (= 0 main_~x~0.base)), 22715#|main_#t~short31|] [2018-02-02 20:55:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:55:35,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:55:35,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:55:35,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:55:35,707 INFO L87 Difference]: Start difference. First operand 356 states and 400 transitions. Second operand 6 states. [2018-02-02 20:55:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:35,818 INFO L93 Difference]: Finished difference Result 380 states and 424 transitions. [2018-02-02 20:55:35,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:55:35,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-02 20:55:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:35,820 INFO L225 Difference]: With dead ends: 380 [2018-02-02 20:55:35,820 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 20:55:35,820 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 20:55:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 20:55:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 355. [2018-02-02 20:55:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-02 20:55:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 398 transitions. [2018-02-02 20:55:35,822 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 398 transitions. Word has length 68 [2018-02-02 20:55:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:35,822 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 398 transitions. [2018-02-02 20:55:35,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:55:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 398 transitions. [2018-02-02 20:55:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:55:35,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:35,823 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:35,823 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1156813523, now seen corresponding path program 1 times [2018-02-02 20:55:35,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:35,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:35,903 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 20:55:35,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:35,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:55:35,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:35,904 INFO 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 20:55:35,904 INFO L182 omatonBuilderFactory]: Interpolants [23459#true, 23460#false, 23461#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 23462#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 23463#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 23464#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 23465#(= 1 (select |#valid| |main_#t~mem34.base|)), 23466#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:55:35,904 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 20:55:35,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:55:35,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:55:35,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:55:35,904 INFO L87 Difference]: Start difference. First operand 355 states and 398 transitions. Second operand 8 states. [2018-02-02 20:55:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:36,117 INFO L93 Difference]: Finished difference Result 463 states and 514 transitions. [2018-02-02 20:55:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:55:36,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-02-02 20:55:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:36,118 INFO L225 Difference]: With dead ends: 463 [2018-02-02 20:55:36,118 INFO L226 Difference]: Without dead ends: 463 [2018-02-02 20:55:36,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:55:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-02 20:55:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 398. [2018-02-02 20:55:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 20:55:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 447 transitions. [2018-02-02 20:55:36,120 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 447 transitions. Word has length 69 [2018-02-02 20:55:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:36,121 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 447 transitions. [2018-02-02 20:55:36,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:55:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 447 transitions. [2018-02-02 20:55:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:55:36,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:36,121 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:36,121 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:36,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1156813524, now seen corresponding path program 1 times [2018-02-02 20:55:36,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:36,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:36,206 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 20:55:36,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:36,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:55:36,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:36,207 INFO L182 omatonBuilderFactory]: Interpolants [24343#true, 24344#false, 24345#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 24346#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc22.offset|)), 24347#(and (= 0 main_~tmp~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| main_~tmp~0.base)) (= main_~x~0.base main_~head~0.base)), 24348#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24349#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24350#(and (= 0 |main_#t~mem34.offset|) (= 8 (select |#length| |main_#t~mem34.base|))), 24351#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 20:55:36,207 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 20:55:36,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:55:36,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:55:36,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:55:36,207 INFO L87 Difference]: Start difference. First operand 398 states and 447 transitions. Second operand 9 states. [2018-02-02 20:55:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:36,443 INFO L93 Difference]: Finished difference Result 491 states and 544 transitions. [2018-02-02 20:55:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:55:36,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-02-02 20:55:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:36,445 INFO L225 Difference]: With dead ends: 491 [2018-02-02 20:55:36,445 INFO L226 Difference]: Without dead ends: 491 [2018-02-02 20:55:36,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:55:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-02-02 20:55:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 399. [2018-02-02 20:55:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 20:55:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 447 transitions. [2018-02-02 20:55:36,448 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 447 transitions. Word has length 69 [2018-02-02 20:55:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:36,448 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 447 transitions. [2018-02-02 20:55:36,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:55:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 447 transitions. [2018-02-02 20:55:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:55:36,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:36,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, 1, 1, 1, 1, 1, 1, 1, 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 20:55:36,448 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash -262983341, now seen corresponding path program 1 times [2018-02-02 20:55:36,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:36,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:36,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:36,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:55:36,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:36,517 INFO 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 20:55:36,517 INFO L182 omatonBuilderFactory]: Interpolants [25252#true, 25253#false, 25254#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 25255#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 25256#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25257#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 25258#(= 1 (select |#valid| |main_#t~mem37.base|)), 25259#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:55:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:36,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:55:36,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:55:36,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:55:36,518 INFO L87 Difference]: Start difference. First operand 399 states and 447 transitions. Second operand 8 states. [2018-02-02 20:55:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:36,852 INFO L93 Difference]: Finished difference Result 489 states and 543 transitions. [2018-02-02 20:55:36,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:55:36,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-02-02 20:55:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:36,854 INFO L225 Difference]: With dead ends: 489 [2018-02-02 20:55:36,854 INFO L226 Difference]: Without dead ends: 489 [2018-02-02 20:55:36,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:55:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-02-02 20:55:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 415. [2018-02-02 20:55:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-02 20:55:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 465 transitions. [2018-02-02 20:55:36,858 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 465 transitions. Word has length 70 [2018-02-02 20:55:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:36,858 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 465 transitions. [2018-02-02 20:55:36,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:55:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 465 transitions. [2018-02-02 20:55:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:55:36,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:36,860 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:36,860 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash -262983340, now seen corresponding path program 1 times [2018-02-02 20:55:36,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:36,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:36,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:36,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:55:36,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:36,975 INFO 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 20:55:36,976 INFO L182 omatonBuilderFactory]: Interpolants [26179#true, 26180#false, 26181#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26182#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc22.offset|)), 26183#(and (= 0 main_~tmp~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| main_~tmp~0.base)) (= main_~x~0.base main_~head~0.base)), 26184#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26185#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26186#(and (= 0 |main_#t~mem37.offset|) (= 8 (select |#length| |main_#t~mem37.base|))), 26187#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 20:55:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:55:36,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:55:36,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:55:36,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:55:36,976 INFO L87 Difference]: Start difference. First operand 415 states and 465 transitions. Second operand 9 states. [2018-02-02 20:55:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:37,220 INFO L93 Difference]: Finished difference Result 499 states and 552 transitions. [2018-02-02 20:55:37,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:55:37,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-02 20:55:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:37,221 INFO L225 Difference]: With dead ends: 499 [2018-02-02 20:55:37,221 INFO L226 Difference]: Without dead ends: 499 [2018-02-02 20:55:37,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:55:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-02 20:55:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 412. [2018-02-02 20:55:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 20:55:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 460 transitions. [2018-02-02 20:55:37,223 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 460 transitions. Word has length 70 [2018-02-02 20:55:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:37,224 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 460 transitions. [2018-02-02 20:55:37,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:55:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 460 transitions. [2018-02-02 20:55:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:55:37,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:37,224 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:37,224 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2022813450, now seen corresponding path program 2 times [2018-02-02 20:55:37,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:37,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:37,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:37,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:55:37,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:37,474 INFO 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 20:55:37,474 INFO L182 omatonBuilderFactory]: Interpolants [27109#true, 27110#false, 27111#(= 1 (select |#valid| main_~head~0.base)), 27112#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 27113#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 27114#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27115#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 27116#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 27117#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 27118#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 27119#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 27120#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 27121#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 27122#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base))), 27123#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27124#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 27125#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27126#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27127#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 27128#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 27129#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 27130#(= 1 (select |#valid| |main_#t~mem20.base|)), 27131#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:55:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:37,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:55:37,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:55:37,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:55:37,475 INFO L87 Difference]: Start difference. First operand 412 states and 460 transitions. Second operand 23 states. [2018-02-02 20:55:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:38,895 INFO L93 Difference]: Finished difference Result 615 states and 684 transitions. [2018-02-02 20:55:38,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:55:38,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-02-02 20:55:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:38,897 INFO L225 Difference]: With dead ends: 615 [2018-02-02 20:55:38,897 INFO L226 Difference]: Without dead ends: 615 [2018-02-02 20:55:38,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=2520, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:55:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-02-02 20:55:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 432. [2018-02-02 20:55:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 20:55:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 485 transitions. [2018-02-02 20:55:38,901 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 485 transitions. Word has length 70 [2018-02-02 20:55:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:38,901 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 485 transitions. [2018-02-02 20:55:38,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:55:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 485 transitions. [2018-02-02 20:55:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:55:38,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:38,902 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:38,902 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:38,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2022813451, now seen corresponding path program 1 times [2018-02-02 20:55:38,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:38,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:39,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:39,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:55:39,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:39,244 INFO 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 20:55:39,244 INFO L182 omatonBuilderFactory]: Interpolants [28256#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 28257#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base))), 28258#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 28259#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28260#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 28261#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 28262#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28263#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 28264#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 28243#true, 28244#false, 28245#(= 1 (select |#valid| main_~head~0.base)), 28246#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 28247#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 28248#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28249#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 28250#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 28251#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 28252#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 28253#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 28254#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 28255#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)))] [2018-02-02 20:55:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:39,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:55:39,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:55:39,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:55:39,245 INFO L87 Difference]: Start difference. First operand 432 states and 485 transitions. Second operand 22 states. [2018-02-02 20:55:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:40,772 INFO L93 Difference]: Finished difference Result 631 states and 702 transitions. [2018-02-02 20:55:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:55:40,772 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-02-02 20:55:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:40,773 INFO L225 Difference]: With dead ends: 631 [2018-02-02 20:55:40,773 INFO L226 Difference]: Without dead ends: 631 [2018-02-02 20:55:40,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:55:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-02-02 20:55:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 439. [2018-02-02 20:55:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 20:55:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 493 transitions. [2018-02-02 20:55:40,777 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 493 transitions. Word has length 70 [2018-02-02 20:55:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:40,777 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 493 transitions. [2018-02-02 20:55:40,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:55:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 493 transitions. [2018-02-02 20:55:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:55:40,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:40,777 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:40,777 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1747894606, now seen corresponding path program 1 times [2018-02-02 20:55:40,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:40,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:55:40,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:40,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:55:40,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:40,874 INFO L182 omatonBuilderFactory]: Interpolants [29392#(<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|)), 29393#(<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)), 29394#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base)))), 29395#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1)) (not (= 0 (select |#valid| main_~x~0.base)))), 29396#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1))), 29387#true, 29388#false, 29389#(= main_~marked~0 1), 29390#(and (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 29391#(<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:55:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:55:40,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:55:40,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:55:40,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:55:40,875 INFO L87 Difference]: Start difference. First operand 439 states and 493 transitions. Second operand 10 states. [2018-02-02 20:55:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:41,090 INFO L93 Difference]: Finished difference Result 506 states and 562 transitions. [2018-02-02 20:55:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:55:41,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-02-02 20:55:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:41,092 INFO L225 Difference]: With dead ends: 506 [2018-02-02 20:55:41,092 INFO L226 Difference]: Without dead ends: 506 [2018-02-02 20:55:41,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:55:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-02-02 20:55:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 424. [2018-02-02 20:55:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 20:55:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 473 transitions. [2018-02-02 20:55:41,095 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 473 transitions. Word has length 71 [2018-02-02 20:55:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:41,095 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 473 transitions. [2018-02-02 20:55:41,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:55:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 473 transitions. [2018-02-02 20:55:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:55:41,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:41,096 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:41,096 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash 560170888, now seen corresponding path program 2 times [2018-02-02 20:55:41,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:41,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:41,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:41,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:55:41,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:41,375 INFO 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 20:55:41,375 INFO L182 omatonBuilderFactory]: Interpolants [30341#true, 30342#false, 30343#(= 1 (select |#valid| main_~head~0.base)), 30344#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 30345#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 30346#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 30347#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 30348#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 30349#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)) (= 0 main_~marked~0)), 30350#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)), 30351#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 30352#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 30353#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base))), 30354#(not (= |main_#t~mem6.base| main_~head~0.base)), 30355#(not (= main_~x~0.base main_~head~0.base)), 30356#(and (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 30357#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))), 30358#(and (not (= 0 (select |#valid| |main_#t~mem16.base|))) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|))), 30359#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base)))), 30360#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1)) (not (= 0 (select |#valid| main_~x~0.base)))), 30361#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1)))] [2018-02-02 20:55:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:41,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:55:41,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:55:41,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:55:41,376 INFO L87 Difference]: Start difference. First operand 424 states and 473 transitions. Second operand 21 states. [2018-02-02 20:55:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:43,073 INFO L93 Difference]: Finished difference Result 578 states and 633 transitions. [2018-02-02 20:55:43,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:55:43,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2018-02-02 20:55:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:43,075 INFO L225 Difference]: With dead ends: 578 [2018-02-02 20:55:43,075 INFO L226 Difference]: Without dead ends: 578 [2018-02-02 20:55:43,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=753, Invalid=4217, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 20:55:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-02 20:55:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 383. [2018-02-02 20:55:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 20:55:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 423 transitions. [2018-02-02 20:55:43,078 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 423 transitions. Word has length 71 [2018-02-02 20:55:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:43,078 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 423 transitions. [2018-02-02 20:55:43,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:55:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 423 transitions. [2018-02-02 20:55:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:55:43,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:43,079 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:43,079 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 755338483, now seen corresponding path program 3 times [2018-02-02 20:55:43,079 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:43,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:43,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:43,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:55:43,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:43,394 INFO 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 20:55:43,395 INFO L182 omatonBuilderFactory]: Interpolants [31456#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 31433#true, 31434#false, 31435#(= 1 (select |#valid| main_~head~0.base)), 31436#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 31437#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 31438#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 31439#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 31440#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 31441#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 31442#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 31443#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 31444#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 31445#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|)), 31446#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 31447#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base))), 31448#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 31449#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31450#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 31451#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)), 31452#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 31453#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 31454#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 31455#(and (<= 0 |main_#t~mem16.offset|) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|)))] [2018-02-02 20:55:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:43,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:55:43,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:55:43,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:55:43,395 INFO L87 Difference]: Start difference. First operand 383 states and 423 transitions. Second operand 24 states. [2018-02-02 20:55:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:44,982 INFO L93 Difference]: Finished difference Result 624 states and 689 transitions. [2018-02-02 20:55:44,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:55:44,982 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-02-02 20:55:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:44,983 INFO L225 Difference]: With dead ends: 624 [2018-02-02 20:55:44,983 INFO L226 Difference]: Without dead ends: 624 [2018-02-02 20:55:44,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=483, Invalid=2823, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:55:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-02-02 20:55:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 385. [2018-02-02 20:55:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 20:55:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 426 transitions. [2018-02-02 20:55:44,986 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 426 transitions. Word has length 72 [2018-02-02 20:55:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:44,987 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 426 transitions. [2018-02-02 20:55:44,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:55:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 426 transitions. [2018-02-02 20:55:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:55:44,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:44,987 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:44,987 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1005697877, now seen corresponding path program 3 times [2018-02-02 20:55:44,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:44,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:45,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:45,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:55:45,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:45,394 INFO 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 20:55:45,394 INFO L182 omatonBuilderFactory]: Interpolants [32544#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 32545#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 32546#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 32547#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 32548#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base main_~head~0.base))), 32549#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 32550#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 32551#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 32552#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 32553#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 32554#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32555#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 32556#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 32557#(= 1 (select |#valid| |main_#t~mem12.base|)), 32534#true, 32535#false, 32536#(= 1 (select |#valid| main_~head~0.base)), 32537#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 32538#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 32539#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 32540#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 32541#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 32542#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 32543#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~marked~0 (select |#valid| main_~x~0.base)))] [2018-02-02 20:55:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:45,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:55:45,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:55:45,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:55:45,394 INFO L87 Difference]: Start difference. First operand 385 states and 426 transitions. Second operand 24 states. [2018-02-02 20:55:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:46,819 INFO L93 Difference]: Finished difference Result 634 states and 694 transitions. [2018-02-02 20:55:46,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:55:46,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-02-02 20:55:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:46,821 INFO L225 Difference]: With dead ends: 634 [2018-02-02 20:55:46,821 INFO L226 Difference]: Without dead ends: 634 [2018-02-02 20:55:46,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:55:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-02 20:55:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 434. [2018-02-02 20:55:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 20:55:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 482 transitions. [2018-02-02 20:55:46,825 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 482 transitions. Word has length 74 [2018-02-02 20:55:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:46,825 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 482 transitions. [2018-02-02 20:55:46,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:55:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 482 transitions. [2018-02-02 20:55:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:55:46,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:46,826 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:46,826 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1005697876, now seen corresponding path program 2 times [2018-02-02 20:55:46,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:46,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:47,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:47,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:55:47,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:47,450 INFO 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 20:55:47,450 INFO L182 omatonBuilderFactory]: Interpolants [33682#true, 33683#false, 33684#(= |main_#t~malloc0.offset| 0), 33685#(= main_~head~0.offset 0), 33686#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 33687#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 33688#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 33689#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 33690#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 33691#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33692#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33693#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~marked~0 1) (= main_~marked~0 (select |#valid| main_~x~0.base))), 33694#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33695#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 33696#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 33697#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 33698#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33699#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 33700#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))), 33701#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 33702#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset |main_#t~mem6.offset|)), 33703#(or (and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 33704#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 33705#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 33706#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 33707#(or (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 33708#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (not |main_#t~short14|)), 33709#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 33710#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 33711#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 33712#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 20:55:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:47,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 20:55:47,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 20:55:47,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:55:47,450 INFO L87 Difference]: Start difference. First operand 434 states and 482 transitions. Second operand 31 states. [2018-02-02 20:55:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:49,778 INFO L93 Difference]: Finished difference Result 592 states and 650 transitions. [2018-02-02 20:55:49,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:55:49,778 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 74 [2018-02-02 20:55:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:49,780 INFO L225 Difference]: With dead ends: 592 [2018-02-02 20:55:49,780 INFO L226 Difference]: Without dead ends: 592 [2018-02-02 20:55:49,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=745, Invalid=4511, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:55:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-02-02 20:55:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 434. [2018-02-02 20:55:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 20:55:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 20:55:49,784 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 74 [2018-02-02 20:55:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:49,784 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 20:55:49,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 20:55:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 20:55:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:55:49,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:49,785 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:49,785 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:49,785 INFO L82 PathProgramCache]: Analyzing trace with hash -456539016, now seen corresponding path program 4 times [2018-02-02 20:55:49,785 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:49,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:50,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:50,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:55:50,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:50,187 INFO 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 20:55:50,187 INFO L182 omatonBuilderFactory]: Interpolants [34823#true, 34824#false, 34825#(= 1 (select |#valid| main_~head~0.base)), 34826#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 34827#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 34828#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34829#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 34830#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 34831#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 34832#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 34833#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 34834#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 34835#(and (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 34836#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 34837#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 34838#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 34839#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 34840#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 34841#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 34842#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 34843#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 34844#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 34845#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 34846#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 34847#(not |main_#t~short14|)] [2018-02-02 20:55:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:50,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:55:50,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:55:50,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:55:50,188 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 25 states. [2018-02-02 20:55:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:52,171 INFO L93 Difference]: Finished difference Result 611 states and 673 transitions. [2018-02-02 20:55:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:55:52,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-02-02 20:55:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:52,172 INFO L225 Difference]: With dead ends: 611 [2018-02-02 20:55:52,172 INFO L226 Difference]: Without dead ends: 611 [2018-02-02 20:55:52,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=474, Invalid=3816, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 20:55:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-02 20:55:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 434. [2018-02-02 20:55:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 20:55:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 20:55:52,175 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 76 [2018-02-02 20:55:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:52,175 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 20:55:52,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:55:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 20:55:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:55:52,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:52,176 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:52,176 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2019274260, now seen corresponding path program 1 times [2018-02-02 20:55:52,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:52,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:52,625 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 20:55:52,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:52,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:55:52,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:52,626 INFO 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 20:55:52,626 INFO L182 omatonBuilderFactory]: Interpolants [35975#true, 35976#false, 35977#(= 1 (select |#valid| main_~head~0.base)), 35978#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 35979#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 35980#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 35981#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 35982#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 35983#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 35984#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 35985#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 35986#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 35987#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|)), 35988#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 35989#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base))), 35990#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 35991#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 35992#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 35993#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)), 35994#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 35995#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 35996#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 35997#(<= 0 |main_#t~mem20.offset|), 35998#(<= 0 main_~x~0.offset), 35999#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:55:52,626 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 20:55:52,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:55:52,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:55:52,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:55:52,627 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 25 states. [2018-02-02 20:55:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:54,813 INFO L93 Difference]: Finished difference Result 615 states and 679 transitions. [2018-02-02 20:55:54,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 20:55:54,813 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-02-02 20:55:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:54,815 INFO L225 Difference]: With dead ends: 615 [2018-02-02 20:55:54,815 INFO L226 Difference]: Without dead ends: 615 [2018-02-02 20:55:54,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1099, Invalid=5543, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 20:55:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-02-02 20:55:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 434. [2018-02-02 20:55:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 20:55:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 20:55:54,818 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 77 [2018-02-02 20:55:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:54,818 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 20:55:54,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:55:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 20:55:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:55:54,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:54,819 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:54,819 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:54,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1707826939, now seen corresponding path program 1 times [2018-02-02 20:55:54,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:54,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:55:54,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:54,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:55:54,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:54,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 20:55:54,867 INFO L182 omatonBuilderFactory]: Interpolants [37168#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 37169#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 37170#(not (= |main_#t~mem37.base| 0)), 37171#(not (= main_~x~0.base 0)), 37163#true, 37164#false, 37165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 37166#(and (not (= |main_#t~malloc22.base| 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 37167#(and (not (= main_~tmp~0.base 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))] [2018-02-02 20:55:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:55:54,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:55:54,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:55:54,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:55:54,867 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 9 states. [2018-02-02 20:55:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:55,044 INFO L93 Difference]: Finished difference Result 528 states and 579 transitions. [2018-02-02 20:55:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:55:55,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-02-02 20:55:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:55,045 INFO L225 Difference]: With dead ends: 528 [2018-02-02 20:55:55,045 INFO L226 Difference]: Without dead ends: 528 [2018-02-02 20:55:55,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:55:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-02-02 20:55:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 434. [2018-02-02 20:55:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 20:55:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 20:55:55,048 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 78 [2018-02-02 20:55:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:55,048 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 20:55:55,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:55:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 20:55:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:55:55,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:55,049 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:55,049 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1992171755, now seen corresponding path program 1 times [2018-02-02 20:55:55,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:55,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:55:55,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:55,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:55:55,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:55,096 INFO L182 omatonBuilderFactory]: Interpolants [38144#true, 38145#false, 38146#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 38147#(and (not (= |main_#t~malloc22.base| 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 38148#(and (not (= main_~tmp~0.base 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 38149#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 38150#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 38151#(not (= |main_#t~mem34.base| 0)), 38152#(not (= main_~x~0.base 0))] [2018-02-02 20:55:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:55:55,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:55:55,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:55:55,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:55:55,097 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 9 states. [2018-02-02 20:55:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:55,276 INFO L93 Difference]: Finished difference Result 529 states and 579 transitions. [2018-02-02 20:55:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:55:55,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-02-02 20:55:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:55,278 INFO L225 Difference]: With dead ends: 529 [2018-02-02 20:55:55,278 INFO L226 Difference]: Without dead ends: 529 [2018-02-02 20:55:55,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:55:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-02 20:55:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 429. [2018-02-02 20:55:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 20:55:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 474 transitions. [2018-02-02 20:55:55,280 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 474 transitions. Word has length 80 [2018-02-02 20:55:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:55,281 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 474 transitions. [2018-02-02 20:55:55,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:55:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 474 transitions. [2018-02-02 20:55:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:55:55,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:55,281 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:55,281 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:55,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1015169157, now seen corresponding path program 3 times [2018-02-02 20:55:55,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:55,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:55,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:55,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:55:55,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:55,672 INFO 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 20:55:55,672 INFO L182 omatonBuilderFactory]: Interpolants [39121#true, 39122#false, 39123#(= 1 (select |#valid| main_~head~0.base)), 39124#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 39125#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 39126#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 39127#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 39128#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 39129#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 39130#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 39131#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 39132#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 39133#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 39134#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base))), 39135#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 39136#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 39137#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 39138#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 39139#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 39140#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 39141#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 39142#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 39143#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 39144#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 39145#(not |main_#t~short19|)] [2018-02-02 20:55:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:55,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:55:55,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:55:55,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:55:55,673 INFO L87 Difference]: Start difference. First operand 429 states and 474 transitions. Second operand 25 states. [2018-02-02 20:55:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:55:57,616 INFO L93 Difference]: Finished difference Result 616 states and 676 transitions. [2018-02-02 20:55:57,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:55:57,616 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-02-02 20:55:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:55:57,617 INFO L225 Difference]: With dead ends: 616 [2018-02-02 20:55:57,617 INFO L226 Difference]: Without dead ends: 616 [2018-02-02 20:55:57,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=498, Invalid=4058, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 20:55:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-02 20:55:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 434. [2018-02-02 20:55:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 20:55:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 20:55:57,620 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 81 [2018-02-02 20:55:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:55:57,621 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 20:55:57,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:55:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 20:55:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:55:57,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:55:57,621 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:55:57,621 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:55:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash -885728171, now seen corresponding path program 4 times [2018-02-02 20:55:57,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:55:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:55:57,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:55:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:58,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:55:58,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:55:58,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:55:58,317 INFO 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 20:55:58,317 INFO L182 omatonBuilderFactory]: Interpolants [40282#true, 40283#false, 40284#(= |main_#t~malloc0.offset| 0), 40285#(= main_~head~0.offset 0), 40286#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 40287#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 40288#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 40289#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 40290#(and (= |main_#t~mem6.offset| 0) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 40291#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 40292#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 40293#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 40294#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))), 40295#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 40296#(and (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset) 0)), 40297#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 40298#(and (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 40299#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 40300#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset) 0)), 40301#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= (select |#valid| main_~x~0.base) 1)), 40302#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= main_~head~0.offset |main_#t~mem6.offset|)), 40303#(and (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (not (= main_~x~0.base main_~head~0.base)))) (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))))), 40304#(and (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 40305#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 40306#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 40307#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0))), 40308#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not |main_#t~short14|)), 40309#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 40310#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 40311#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 40312#(= 1 (select |#valid| |main_#t~mem20.base|)), 40313#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:55:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:55:58,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:55:58,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:55:58,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:55:58,318 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 32 states. [2018-02-02 20:56:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:02,739 INFO L93 Difference]: Finished difference Result 696 states and 768 transitions. [2018-02-02 20:56:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-02 20:56:02,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 82 [2018-02-02 20:56:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:02,741 INFO L225 Difference]: With dead ends: 696 [2018-02-02 20:56:02,741 INFO L226 Difference]: Without dead ends: 696 [2018-02-02 20:56:02,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2835 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1554, Invalid=8546, Unknown=0, NotChecked=0, Total=10100 [2018-02-02 20:56:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-02 20:56:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 454. [2018-02-02 20:56:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-02 20:56:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 506 transitions. [2018-02-02 20:56:02,744 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 506 transitions. Word has length 82 [2018-02-02 20:56:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:02,745 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 506 transitions. [2018-02-02 20:56:02,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:56:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 506 transitions. [2018-02-02 20:56:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:56:02,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:02,746 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:02,746 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash -885728170, now seen corresponding path program 2 times [2018-02-02 20:56:02,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:02,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:03,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:03,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:56:03,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:03,439 INFO L182 omatonBuilderFactory]: Interpolants [41602#true, 41603#false, 41604#(= 1 (select |#valid| main_~head~0.base)), 41605#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 41606#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 41607#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 41608#(and (= |main_#t~mem6.offset| 0) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 41609#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41610#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41611#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 41612#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41613#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~malloc4.base| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 41614#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)) (= (select |#valid| main_~x~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 41615#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41616#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41617#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41618#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 41619#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41620#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41621#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41622#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41623#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 41624#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))), 41625#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 41626#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 41627#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 41628#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 41629#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 20:56:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:03,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:56:03,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:56:03,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:56:03,440 INFO L87 Difference]: Start difference. First operand 454 states and 506 transitions. Second operand 28 states. [2018-02-02 20:56:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:05,284 INFO L93 Difference]: Finished difference Result 617 states and 678 transitions. [2018-02-02 20:56:05,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:56:05,285 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 82 [2018-02-02 20:56:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:05,286 INFO L225 Difference]: With dead ends: 617 [2018-02-02 20:56:05,286 INFO L226 Difference]: Without dead ends: 617 [2018-02-02 20:56:05,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=294, Invalid=2156, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:56:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-02-02 20:56:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 445. [2018-02-02 20:56:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 20:56:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 494 transitions. [2018-02-02 20:56:05,289 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 494 transitions. Word has length 82 [2018-02-02 20:56:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:05,289 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 494 transitions. [2018-02-02 20:56:05,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:56:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 494 transitions. [2018-02-02 20:56:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:56:05,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:05,290 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:05,290 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash -346036697, now seen corresponding path program 1 times [2018-02-02 20:56:05,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:05,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:05,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:05,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:56:05,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:05,539 INFO 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 20:56:05,539 INFO L182 omatonBuilderFactory]: Interpolants [42752#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 42753#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 42754#(= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)), 42755#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset))), 42756#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 42757#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 42758#(= 1 (select |#valid| |main_#t~mem34.base|)), 42759#(= 1 (select |#valid| main_~x~0.base)), 42736#true, 42737#false, 42738#(= 1 (select |#valid| main_~head~0.base)), 42739#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 42740#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 42741#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 42742#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 42743#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 42744#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)) (= 0 main_~marked~0)), 42745#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 42746#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 42747#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 42748#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 42749#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~head~0.base |main_#t~mem20.base|)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 42750#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 42751#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc22.base| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 20:56:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:05,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:56:05,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:56:05,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:56:05,539 INFO L87 Difference]: Start difference. First operand 445 states and 494 transitions. Second operand 24 states. [2018-02-02 20:56:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:06,465 INFO L93 Difference]: Finished difference Result 697 states and 767 transitions. [2018-02-02 20:56:06,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:56:06,466 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 83 [2018-02-02 20:56:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:06,467 INFO L225 Difference]: With dead ends: 697 [2018-02-02 20:56:06,467 INFO L226 Difference]: Without dead ends: 697 [2018-02-02 20:56:06,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=1999, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:56:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-02-02 20:56:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 493. [2018-02-02 20:56:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-02-02 20:56:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 548 transitions. [2018-02-02 20:56:06,471 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 548 transitions. Word has length 83 [2018-02-02 20:56:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:06,471 INFO L432 AbstractCegarLoop]: Abstraction has 493 states and 548 transitions. [2018-02-02 20:56:06,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:56:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 548 transitions. [2018-02-02 20:56:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:56:06,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:06,472 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:06,472 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash -346036696, now seen corresponding path program 1 times [2018-02-02 20:56:06,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:06,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:06,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:06,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:56:06,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:06,850 INFO L182 omatonBuilderFactory]: Interpolants [44002#true, 44003#false, 44004#(= 1 (select |#valid| main_~head~0.base)), 44005#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 44006#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 44007#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 44008#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44009#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 44010#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44011#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44012#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 44013#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select |#length| |main_#t~mem12.base|)) (= main_~x~0.base main_~head~0.base) (= 8 (select |#length| |main_#t~mem12.base|))), 44014#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 44015#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~head~0.base |main_#t~mem20.base|)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| |main_#t~mem20.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44016#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44017#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc22.base| main_~head~0.base)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44018#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44019#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmp~0.base (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 44020#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~tmp~0.offset)) main_~head~0.base) main_~head~0.offset))), 44021#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 44022#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 44023#(and (= 0 |main_#t~mem34.offset|) (= 8 (select |#length| |main_#t~mem34.base|))), 44024#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 20:56:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:06,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:56:06,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:56:06,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:06,850 INFO L87 Difference]: Start difference. First operand 493 states and 548 transitions. Second operand 23 states. [2018-02-02 20:56:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:07,634 INFO L93 Difference]: Finished difference Result 641 states and 701 transitions. [2018-02-02 20:56:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:56:07,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2018-02-02 20:56:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:07,635 INFO L225 Difference]: With dead ends: 641 [2018-02-02 20:56:07,635 INFO L226 Difference]: Without dead ends: 641 [2018-02-02 20:56:07,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:56:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-02-02 20:56:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 494. [2018-02-02 20:56:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 20:56:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 548 transitions. [2018-02-02 20:56:07,638 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 548 transitions. Word has length 83 [2018-02-02 20:56:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:07,639 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 548 transitions. [2018-02-02 20:56:07,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:56:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 548 transitions. [2018-02-02 20:56:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:56:07,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:07,639 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:07,639 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1260977275, now seen corresponding path program 1 times [2018-02-02 20:56:07,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:07,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:07,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:07,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:56:07,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:07,855 INFO L182 omatonBuilderFactory]: Interpolants [45184#true, 45185#false, 45186#(= 1 (select |#valid| main_~head~0.base)), 45187#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 45188#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 45189#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 45190#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 45191#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 45192#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)) (= 0 main_~marked~0)), 45193#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 45194#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 45195#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 45196#(and (not (= 0 (select |#valid| main_~head~0.base))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|))), 45197#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 45198#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc22.base| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 45199#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 45200#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 45201#(= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)), 45202#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset))), 45203#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 45204#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 45205#(= 1 (select |#valid| |main_#t~mem34.base|)), 45206#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:56:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:07,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:56:07,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:56:07,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:07,856 INFO L87 Difference]: Start difference. First operand 494 states and 548 transitions. Second operand 23 states. [2018-02-02 20:56:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:08,845 INFO L93 Difference]: Finished difference Result 734 states and 810 transitions. [2018-02-02 20:56:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:56:08,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2018-02-02 20:56:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:08,847 INFO L225 Difference]: With dead ends: 734 [2018-02-02 20:56:08,847 INFO L226 Difference]: Without dead ends: 734 [2018-02-02 20:56:08,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=1999, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:56:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-02-02 20:56:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 547. [2018-02-02 20:56:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-02-02 20:56:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 607 transitions. [2018-02-02 20:56:08,850 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 607 transitions. Word has length 83 [2018-02-02 20:56:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:08,851 INFO L432 AbstractCegarLoop]: Abstraction has 547 states and 607 transitions. [2018-02-02 20:56:08,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:56:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 607 transitions. [2018-02-02 20:56:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:56:08,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:08,851 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:08,851 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1260977276, now seen corresponding path program 1 times [2018-02-02 20:56:08,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:08,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:09,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:09,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:56:09,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:09,257 INFO 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 20:56:09,257 INFO L182 omatonBuilderFactory]: Interpolants [46560#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~tmp~0.offset)) main_~head~0.base) main_~head~0.offset))), 46561#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 46562#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 46563#(and (= 0 |main_#t~mem34.offset|) (= 8 (select |#length| |main_#t~mem34.base|))), 46564#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 46542#true, 46543#false, 46544#(= 1 (select |#valid| main_~head~0.base)), 46545#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 46546#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 46547#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 46548#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 46549#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 46550#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 46551#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 46552#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 46553#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 46554#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 46555#(and (not (= 0 (select |#valid| main_~head~0.base))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| |main_#t~mem16.base|))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| |main_#t~mem16.base|))), 46556#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 46557#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc22.base|)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 46558#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 46559#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmp~0.base (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 20:56:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:09,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:56:09,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:56:09,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:09,258 INFO L87 Difference]: Start difference. First operand 547 states and 607 transitions. Second operand 23 states. [2018-02-02 20:56:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:10,296 INFO L93 Difference]: Finished difference Result 742 states and 817 transitions. [2018-02-02 20:56:10,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:56:10,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2018-02-02 20:56:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:10,298 INFO L225 Difference]: With dead ends: 742 [2018-02-02 20:56:10,298 INFO L226 Difference]: Without dead ends: 742 [2018-02-02 20:56:10,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:56:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-02-02 20:56:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 505. [2018-02-02 20:56:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-02-02 20:56:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 559 transitions. [2018-02-02 20:56:10,301 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 559 transitions. Word has length 83 [2018-02-02 20:56:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:10,302 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 559 transitions. [2018-02-02 20:56:10,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:56:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 559 transitions. [2018-02-02 20:56:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:56:10,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:10,302 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:10,302 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1747966924, now seen corresponding path program 2 times [2018-02-02 20:56:10,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:10,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:56:10,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:10,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:56:10,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:10,461 INFO 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 20:56:10,461 INFO L182 omatonBuilderFactory]: Interpolants [47850#true, 47851#false, 47852#(= 1 (select |#valid| main_~head~0.base)), 47853#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 47854#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~x~0.base main_~head~0.base)), 47855#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base)), 47856#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base |main_#t~mem6.base|))), 47857#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~x~0.base main_~head~0.base))), 47858#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)) (= 0 main_~marked~0)), 47859#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 47860#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 47861#(and (= 1 (select |#valid| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0))), 47862#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= 0 (select |#valid| main_~x~0.base)))), 47863#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= main_~x~0.base |main_#t~malloc22.base|))), 47864#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= main_~tmp~0.base main_~x~0.base))), 47865#(not (= (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~x~0.base) main_~x~0.offset) 0)), 47866#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:56:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:56:10,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:56:10,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:56:10,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:56:10,462 INFO L87 Difference]: Start difference. First operand 505 states and 559 transitions. Second operand 17 states. [2018-02-02 20:56:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:10,968 INFO L93 Difference]: Finished difference Result 616 states and 681 transitions. [2018-02-02 20:56:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:56:10,968 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 83 [2018-02-02 20:56:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:10,969 INFO L225 Difference]: With dead ends: 616 [2018-02-02 20:56:10,969 INFO L226 Difference]: Without dead ends: 616 [2018-02-02 20:56:10,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:56:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-02 20:56:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 517. [2018-02-02 20:56:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-02-02 20:56:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 571 transitions. [2018-02-02 20:56:10,972 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 571 transitions. Word has length 83 [2018-02-02 20:56:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:10,972 INFO L432 AbstractCegarLoop]: Abstraction has 517 states and 571 transitions. [2018-02-02 20:56:10,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:56:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 571 transitions. [2018-02-02 20:56:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:56:10,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:10,973 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, 1, 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 20:56:10,973 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:10,973 INFO L82 PathProgramCache]: Analyzing trace with hash 393300095, now seen corresponding path program 1 times [2018-02-02 20:56:10,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:10,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:11,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:11,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:56:11,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:11,175 INFO 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 20:56:11,175 INFO L182 omatonBuilderFactory]: Interpolants [49026#true, 49027#false, 49028#(= 1 (select |#valid| main_~head~0.base)), 49029#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 49030#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 49031#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 49032#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 49033#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 49034#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)) (= 0 main_~marked~0)), 49035#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 49036#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 49037#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 49038#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 49039#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~head~0.base |main_#t~mem20.base|)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 49040#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 49041#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc22.base| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 49042#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 49043#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 49044#(= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)), 49045#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset))), 49046#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 49047#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 49048#(= 1 (select |#valid| |main_#t~mem37.base|)), 49049#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:56:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:11,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:56:11,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:56:11,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:56:11,176 INFO L87 Difference]: Start difference. First operand 517 states and 571 transitions. Second operand 24 states. [2018-02-02 20:56:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:12,163 INFO L93 Difference]: Finished difference Result 756 states and 833 transitions. [2018-02-02 20:56:12,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:56:12,163 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-02-02 20:56:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:12,165 INFO L225 Difference]: With dead ends: 756 [2018-02-02 20:56:12,165 INFO L226 Difference]: Without dead ends: 756 [2018-02-02 20:56:12,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=458, Invalid=2092, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:56:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-02 20:56:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 556. [2018-02-02 20:56:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-02-02 20:56:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 614 transitions. [2018-02-02 20:56:12,169 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 614 transitions. Word has length 84 [2018-02-02 20:56:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:12,169 INFO L432 AbstractCegarLoop]: Abstraction has 556 states and 614 transitions. [2018-02-02 20:56:12,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:56:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 614 transitions. [2018-02-02 20:56:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:56:12,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:12,170 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, 1, 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 20:56:12,170 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash 393300096, now seen corresponding path program 1 times [2018-02-02 20:56:12,171 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:12,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:12,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:12,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:56:12,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:12,497 INFO L182 omatonBuilderFactory]: Interpolants [50432#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50433#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmp~0.base (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 50434#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~tmp~0.offset)) main_~head~0.base) main_~head~0.offset))), 50435#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50436#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 50437#(and (= 0 |main_#t~mem37.offset|) (= 8 (select |#length| |main_#t~mem37.base|))), 50438#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 50416#true, 50417#false, 50418#(= 1 (select |#valid| main_~head~0.base)), 50419#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 50420#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 50421#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 50422#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50423#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 50424#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50425#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50426#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 50427#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select |#length| |main_#t~mem12.base|)) (= main_~x~0.base main_~head~0.base) (= 8 (select |#length| |main_#t~mem12.base|))), 50428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 50429#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~head~0.base |main_#t~mem20.base|)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| |main_#t~mem20.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50430#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50431#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc22.base| main_~head~0.base)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:56:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:12,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:56:12,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:56:12,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:12,498 INFO L87 Difference]: Start difference. First operand 556 states and 614 transitions. Second operand 23 states. [2018-02-02 20:56:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:13,176 INFO L93 Difference]: Finished difference Result 687 states and 752 transitions. [2018-02-02 20:56:13,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:56:13,176 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2018-02-02 20:56:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:13,177 INFO L225 Difference]: With dead ends: 687 [2018-02-02 20:56:13,177 INFO L226 Difference]: Without dead ends: 687 [2018-02-02 20:56:13,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:56:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-02-02 20:56:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 553. [2018-02-02 20:56:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-02-02 20:56:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 609 transitions. [2018-02-02 20:56:13,183 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 609 transitions. Word has length 84 [2018-02-02 20:56:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:13,184 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 609 transitions. [2018-02-02 20:56:13,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:56:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 609 transitions. [2018-02-02 20:56:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:56:13,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:13,185 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, 1, 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 20:56:13,185 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1328874325, now seen corresponding path program 1 times [2018-02-02 20:56:13,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:13,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:13,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:13,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:56:13,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:13,436 INFO 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 20:56:13,437 INFO L182 omatonBuilderFactory]: Interpolants [51712#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 51713#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 51714#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 51715#(and (not (= 0 (select |#valid| main_~head~0.base))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|))), 51716#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 51717#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc22.base| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 51718#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 51719#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 51720#(= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)), 51721#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset))), 51722#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 51723#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 51724#(= 1 (select |#valid| |main_#t~mem37.base|)), 51725#(= 1 (select |#valid| main_~x~0.base)), 51703#true, 51704#false, 51705#(= 1 (select |#valid| main_~head~0.base)), 51706#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 51707#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 51708#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 51709#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 51710#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 51711#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)) (= 0 main_~marked~0))] [2018-02-02 20:56:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:13,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:56:13,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:56:13,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:13,437 INFO L87 Difference]: Start difference. First operand 553 states and 609 transitions. Second operand 23 states. [2018-02-02 20:56:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:14,434 INFO L93 Difference]: Finished difference Result 771 states and 849 transitions. [2018-02-02 20:56:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:56:14,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2018-02-02 20:56:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:14,436 INFO L225 Difference]: With dead ends: 771 [2018-02-02 20:56:14,436 INFO L226 Difference]: Without dead ends: 771 [2018-02-02 20:56:14,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=458, Invalid=2092, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:56:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-02-02 20:56:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 569. [2018-02-02 20:56:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-02-02 20:56:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 627 transitions. [2018-02-02 20:56:14,440 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 627 transitions. Word has length 84 [2018-02-02 20:56:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:14,440 INFO L432 AbstractCegarLoop]: Abstraction has 569 states and 627 transitions. [2018-02-02 20:56:14,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:56:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 627 transitions. [2018-02-02 20:56:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:56:14,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:14,441 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, 1, 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 20:56:14,441 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:14,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1328874324, now seen corresponding path program 1 times [2018-02-02 20:56:14,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:14,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:14,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:14,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:56:14,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:14,810 INFO 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 20:56:14,810 INFO L182 omatonBuilderFactory]: Interpolants [53122#true, 53123#false, 53124#(= 1 (select |#valid| main_~head~0.base)), 53125#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 53126#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 53127#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 53128#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 53129#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 53130#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 53131#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 53132#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 53133#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 53134#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)), 53135#(and (not (= 0 (select |#valid| main_~head~0.base))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| |main_#t~mem16.base|))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| |main_#t~mem16.base|))), 53136#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 53137#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc22.base|)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 53138#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~tmp~0.base main_~head~0.base)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 53139#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmp~0.base (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 53140#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~tmp~0.base)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~tmp~0.offset)) main_~head~0.base) main_~head~0.offset))), 53141#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 53142#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 53143#(and (= 0 |main_#t~mem37.offset|) (= 8 (select |#length| |main_#t~mem37.base|))), 53144#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 20:56:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:14,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:56:14,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:56:14,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:14,811 INFO L87 Difference]: Start difference. First operand 569 states and 627 transitions. Second operand 23 states. [2018-02-02 20:56:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:15,921 INFO L93 Difference]: Finished difference Result 769 states and 845 transitions. [2018-02-02 20:56:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:56:15,921 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2018-02-02 20:56:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:15,922 INFO L225 Difference]: With dead ends: 769 [2018-02-02 20:56:15,923 INFO L226 Difference]: Without dead ends: 769 [2018-02-02 20:56:15,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=304, Invalid=1336, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:56:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-02-02 20:56:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 530. [2018-02-02 20:56:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-02 20:56:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 584 transitions. [2018-02-02 20:56:15,929 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 584 transitions. Word has length 84 [2018-02-02 20:56:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:15,929 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 584 transitions. [2018-02-02 20:56:15,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:56:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 584 transitions. [2018-02-02 20:56:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:56:15,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:15,930 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:15,930 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1362215134, now seen corresponding path program 1 times [2018-02-02 20:56:15,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:15,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:16,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:16,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:56:16,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:16,294 INFO 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 20:56:16,294 INFO L182 omatonBuilderFactory]: Interpolants [54480#true, 54481#false, 54482#(= 1 (select |#valid| main_~head~0.base)), 54483#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 54484#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 54485#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 54486#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 54487#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 54488#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 54489#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 54490#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 54491#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 54492#(and (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 54493#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 54494#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 54495#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 54496#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 54497#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 54498#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 54499#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 54500#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 54501#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 54502#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 54503#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 54504#(not |main_#t~short19|)] [2018-02-02 20:56:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:16,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:56:16,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:56:16,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:56:16,295 INFO L87 Difference]: Start difference. First operand 530 states and 584 transitions. Second operand 25 states. [2018-02-02 20:56:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:18,313 INFO L93 Difference]: Finished difference Result 686 states and 754 transitions. [2018-02-02 20:56:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:56:18,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-02-02 20:56:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:18,315 INFO L225 Difference]: With dead ends: 686 [2018-02-02 20:56:18,315 INFO L226 Difference]: Without dead ends: 686 [2018-02-02 20:56:18,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=498, Invalid=4058, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 20:56:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-02-02 20:56:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 530. [2018-02-02 20:56:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-02 20:56:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 584 transitions. [2018-02-02 20:56:18,318 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 584 transitions. Word has length 84 [2018-02-02 20:56:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:18,319 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 584 transitions. [2018-02-02 20:56:18,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:56:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 584 transitions. [2018-02-02 20:56:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:56:18,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:18,319 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:18,319 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1670550398, now seen corresponding path program 4 times [2018-02-02 20:56:18,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:18,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:18,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:18,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:56:18,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:18,756 INFO 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 20:56:18,756 INFO L182 omatonBuilderFactory]: Interpolants [55808#false, 55809#(= 1 (select |#valid| main_~head~0.base)), 55810#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 55811#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 55812#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 55813#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 55814#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 55815#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 55816#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 55817#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~marked~0 (select |#valid| main_~x~0.base))), 55818#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 55819#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|)), 55820#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 55821#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base))), 55822#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 55823#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 55824#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 55825#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 55826#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 55827#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 55828#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 55829#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)), 55830#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 55831#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 55832#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 55833#(and (<= 0 |main_#t~mem16.offset|) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|))), 55834#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 55807#true] [2018-02-02 20:56:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:18,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:56:18,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:56:18,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:56:18,757 INFO L87 Difference]: Start difference. First operand 530 states and 584 transitions. Second operand 28 states. [2018-02-02 20:56:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:21,066 INFO L93 Difference]: Finished difference Result 715 states and 788 transitions. [2018-02-02 20:56:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:56:21,067 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-02-02 20:56:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:21,068 INFO L225 Difference]: With dead ends: 715 [2018-02-02 20:56:21,068 INFO L226 Difference]: Without dead ends: 715 [2018-02-02 20:56:21,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=550, Invalid=3610, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:56:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-02-02 20:56:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 544. [2018-02-02 20:56:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-02-02 20:56:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 602 transitions. [2018-02-02 20:56:21,072 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 602 transitions. Word has length 84 [2018-02-02 20:56:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:21,072 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 602 transitions. [2018-02-02 20:56:21,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:56:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 602 transitions. [2018-02-02 20:56:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:56:21,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:21,072 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:21,072 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash -747841698, now seen corresponding path program 1 times [2018-02-02 20:56:21,073 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:21,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:56:21,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:21,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:56:21,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:21,188 INFO 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 20:56:21,188 INFO L182 omatonBuilderFactory]: Interpolants [57168#true, 57169#false, 57170#(= 1 (select |#valid| main_~head~0.base)), 57171#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 57172#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~x~0.base main_~head~0.base)), 57173#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base)), 57174#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base |main_#t~mem6.base|))), 57175#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~x~0.base main_~head~0.base))), 57176#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)), 57177#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 57178#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 57179#(and (= 1 (select |#valid| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 57180#(and |main_#t~short14| (= 1 (select |#valid| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)))] [2018-02-02 20:56:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:56:21,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:56:21,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:56:21,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:56:21,189 INFO L87 Difference]: Start difference. First operand 544 states and 602 transitions. Second operand 13 states. [2018-02-02 20:56:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:21,468 INFO L93 Difference]: Finished difference Result 568 states and 626 transitions. [2018-02-02 20:56:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:56:21,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-02 20:56:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:21,469 INFO L225 Difference]: With dead ends: 568 [2018-02-02 20:56:21,469 INFO L226 Difference]: Without dead ends: 568 [2018-02-02 20:56:21,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:56:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-02-02 20:56:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 539. [2018-02-02 20:56:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-02-02 20:56:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 596 transitions. [2018-02-02 20:56:21,473 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 596 transitions. Word has length 86 [2018-02-02 20:56:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:21,473 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 596 transitions. [2018-02-02 20:56:21,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:56:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 596 transitions. [2018-02-02 20:56:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:56:21,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:21,473 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 20:56:21,474 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1955343242, now seen corresponding path program 5 times [2018-02-02 20:56:21,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:21,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:22,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:22,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:56:22,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:22,394 INFO 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 20:56:22,395 INFO L182 omatonBuilderFactory]: Interpolants [58306#true, 58307#false, 58308#(= 0 (select |#valid| 0)), 58309#(and (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 58310#(and (= 0 (select |#valid| 0)) (= main_~head~0.offset 0)), 58311#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~head~0.offset 0)), 58312#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 58313#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 58314#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 58315#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 58316#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 58317#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 58318#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 58319#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))), 58320#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 58321#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 58322#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 58323#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 58324#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 58325#(and (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 58326#(and (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select |#valid| 0) 1)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 58327#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 58328#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 58329#(and (or (and (= main_~head~0.offset |main_#t~malloc4.offset|) (not (= (select |#valid| 0) 1))) (not (= main_~head~0.base |main_#t~malloc4.base|))) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))) (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))))), 58330#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (or (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select |#valid| 0) 1))))), 58331#(and (or (and (not (= (select |#valid| 0) 1)) (= main_~head~0.offset |main_#t~mem6.offset|)) (not (= main_~head~0.base |main_#t~mem6.base|))) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 58332#(or (and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (not (= (select |#valid| 0) 1)) (= main_~x~0.base main_~head~0.base))), 58333#(or (and (= main_~x~0.offset main_~head~0.offset) (not (= (select |#valid| 0) 1)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 58334#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select |#valid| 0) 1))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 58335#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (and (not (= (select |#valid| 0) 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 58336#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem11.base|) (= |main_#t~mem11.base| 0) (not (= (select |#valid| 0) 1)))), 58337#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= (select |#valid| |main_#t~mem12.base|) 1))), 58338#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 58339#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 58340#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 58341#(= 1 (select |#valid| |main_#t~mem12.base|))] [2018-02-02 20:56:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:22,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:56:22,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:56:22,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:56:22,395 INFO L87 Difference]: Start difference. First operand 539 states and 596 transitions. Second operand 36 states. [2018-02-02 20:56:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:27,169 INFO L93 Difference]: Finished difference Result 861 states and 950 transitions. [2018-02-02 20:56:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-02 20:56:27,170 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 86 [2018-02-02 20:56:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:27,171 INFO L225 Difference]: With dead ends: 861 [2018-02-02 20:56:27,171 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 20:56:27,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3016 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1606, Invalid=9524, Unknown=0, NotChecked=0, Total=11130 [2018-02-02 20:56:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 20:56:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 588. [2018-02-02 20:56:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-02-02 20:56:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 652 transitions. [2018-02-02 20:56:27,175 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 652 transitions. Word has length 86 [2018-02-02 20:56:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:27,175 INFO L432 AbstractCegarLoop]: Abstraction has 588 states and 652 transitions. [2018-02-02 20:56:27,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:56:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 652 transitions. [2018-02-02 20:56:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:56:27,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:27,176 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 20:56:27,176 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1955343241, now seen corresponding path program 3 times [2018-02-02 20:56:27,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:27,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:28,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:28,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:56:28,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:28,203 INFO 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 20:56:28,204 INFO L182 omatonBuilderFactory]: Interpolants [59931#true, 59932#false, 59933#(= |main_#t~malloc0.offset| 0), 59934#(= main_~head~0.offset 0), 59935#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 59936#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 59937#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 59938#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 59939#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 59940#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 59941#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 59942#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 59943#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))), 59944#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 59945#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) 0)) (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 59946#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 59947#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 59948#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 59949#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (= (select |#length| main_~x~0.base) 8) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 59950#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#length| main_~x~0.base) 8) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 59951#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (= main_~head~0.offset 0)), 59952#(and (not (= 0 (select |#valid| main_~head~0.base))) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))) (= main_~head~0.offset 0)), 59953#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| main_~x~0.base))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 59954#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) 0)) (= main_~head~0.offset |main_#t~malloc4.offset|) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))))), 59955#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 59956#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~head~0.offset |main_#t~mem6.offset|)), 59957#(and (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 59958#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 59959#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 59960#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 59961#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 59962#(and (= |main_#t~mem12.offset| 0) (<= 8 (select |#length| |main_#t~mem12.base|)))] [2018-02-02 20:56:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:28,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:56:28,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:56:28,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:56:28,204 INFO L87 Difference]: Start difference. First operand 588 states and 652 transitions. Second operand 32 states. Received shutdown request... [2018-02-02 20:56:29,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:56:29,584 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:56:29,588 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:56:29,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:56:29 BoogieIcfgContainer [2018-02-02 20:56:29,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:56:29,589 INFO L168 Benchmark]: Toolchain (without parser) took 80531.33 ms. Allocated memory was 401.1 MB in the beginning and 1.4 GB in the end (delta: 951.6 MB). Free memory was 358.0 MB in the beginning and 764.8 MB in the end (delta: -406.9 MB). Peak memory consumption was 544.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:29,590 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:56:29,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.29 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 345.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:29,590 INFO L168 Benchmark]: Boogie Preprocessor took 31.02 ms. Allocated memory is still 401.1 MB. Free memory was 345.9 MB in the beginning and 343.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:29,590 INFO L168 Benchmark]: RCFGBuilder took 434.12 ms. Allocated memory is still 401.1 MB. Free memory was 343.3 MB in the beginning and 300.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:29,590 INFO L168 Benchmark]: TraceAbstraction took 79896.35 ms. Allocated memory was 401.1 MB in the beginning and 1.4 GB in the end (delta: 951.6 MB). Free memory was 300.1 MB in the beginning and 764.8 MB in the end (delta: -464.7 MB). Peak memory consumption was 486.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:29,591 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 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.29 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 345.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.02 ms. Allocated memory is still 401.1 MB. Free memory was 345.9 MB in the beginning and 343.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 434.12 ms. Allocated memory is still 401.1 MB. Free memory was 343.3 MB in the beginning and 300.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 79896.35 ms. Allocated memory was 401.1 MB in the beginning and 1.4 GB in the end (delta: 951.6 MB). Free memory was 300.1 MB in the beginning and 764.8 MB in the end (delta: -464.7 MB). Peak memory consumption was 486.9 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 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (588states) and interpolant automaton (currently 25 states, 32 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 169 locations, 63 error locations. TIMEOUT Result, 79.8s OverallTime, 65 OverallIterations, 5 TraceHistogramMax, 63.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7743 SDtfs, 46974 SDslu, 65710 SDs, 0 SdLazy, 71550 SolverSat, 6643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2457 GetRequests, 165 SyntacticMatches, 102 SemanticMatches, 2189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28518 ImplicationChecksByTransitivity, 41.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=588occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 160/1243 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 64 MinimizatonAttempts, 8306 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 3989 NumberOfCodeBlocks, 3989 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3924 ConstructedInterpolants, 0 QuantifiedInterpolants, 5071946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 17 PerfectInterpolantSequences, 160/1243 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/sll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-56-29-597.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-56-29-597.csv Completed graceful shutdown