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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 14:24:15,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 14:24:15,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 14:24:15,806 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 14:24:15,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 14:24:15,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 14:24:15,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 14:24:15,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 14:24:15,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 14:24:15,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 14:24:15,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 14:24:15,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 14:24:15,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 14:24:15,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 14:24:15,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 14:24:15,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 14:24:15,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 14:24:15,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 14:24:15,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 14:24:15,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 14:24:15,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 14:24:15,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 14:24:15,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 14:24:15,827 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 14:24:15,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 14:24:15,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 14:24:15,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 14:24:15,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 14:24:15,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 14:24:15,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 14:24:15,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 14:24:15,831 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-04-11 14:24:15,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 14:24:15,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 14:24:15,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 14:24:15,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 14:24:15,854 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 14:24:15,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 14:24:15,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 14:24:15,854 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 14:24:15,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 14:24:15,855 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 14:24:15,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 14:24:15,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:24:15,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 14:24:15,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 14:24:15,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 14:24:15,892 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 14:24:15,895 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 14:24:15,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 14:24:15,896 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 14:24:15,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i [2018-04-11 14:24:16,173 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdba86eda8 [2018-04-11 14:24:16,289 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 14:24:16,290 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 14:24:16,290 INFO L168 CDTParser]: Scanning test-bitfields-3_false-valid-deref.i [2018-04-11 14:24:16,291 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 14:24:16,291 INFO L215 ultiparseSymbolTable]: [2018-04-11 14:24:16,291 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 14:24:16,291 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_false-valid-deref.i [2018-04-11 14:24:16,291 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 14:24:16,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-3_false-valid-deref.i [2018-04-11 14:24:16,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-3_false-valid-deref.i [2018-04-11 14:24:16,303 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdba86eda8 [2018-04-11 14:24:16,306 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 14:24:16,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 14:24:16,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 14:24:16,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 14:24:16,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 14:24:16,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7239e4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16, skipping insertion in model container [2018-04-11 14:24:16,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,326 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:24:16,336 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:24:16,434 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:24:16,457 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:24:16,462 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 14:24:16,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16 WrapperNode [2018-04-11 14:24:16,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 14:24:16,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 14:24:16,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 14:24:16,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 14:24:16,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (1/1) ... [2018-04-11 14:24:16,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 14:24:16,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 14:24:16,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 14:24:16,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 14:24:16,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (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-04-11 14:24:16,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 14:24:16,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 14:24:16,534 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 14:24:16,534 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 14:24:16,534 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 14:24:16,534 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 14:24:16,534 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 14:24:16,534 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 14:24:16,535 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 14:24:16,858 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 14:24:16,877 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 14:24:16,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:24:16 BoogieIcfgContainer [2018-04-11 14:24:16,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 14:24:16,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 14:24:16,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 14:24:16,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 14:24:16,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 02:24:16" (1/3) ... [2018-04-11 14:24:16,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b60dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:24:16, skipping insertion in model container [2018-04-11 14:24:16,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:16" (2/3) ... [2018-04-11 14:24:16,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b60dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:24:16, skipping insertion in model container [2018-04-11 14:24:16,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:24:16" (3/3) ... [2018-04-11 14:24:16,883 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i [2018-04-11 14:24:16,889 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 14:24:16,895 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-11 14:24:16,919 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 14:24:16,919 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 14:24:16,919 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 14:24:16,919 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 14:24:16,920 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 14:24:16,920 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 14:24:16,920 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 14:24:16,920 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 14:24:16,920 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 14:24:16,920 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 14:24:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-11 14:24:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 14:24:16,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:16,937 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:16,937 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:16,940 INFO L82 PathProgramCache]: Analyzing trace with hash -383275974, now seen corresponding path program 1 times [2018-04-11 14:24:16,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:17,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:17,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:24:17,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,071 INFO L182 omatonBuilderFactory]: Interpolants [130#true, 131#false, 132#(= 1 (select |#valid| |main_#t~malloc0.base|)), 133#(= 1 (select |#valid| main_~p~0.base))] [2018-04-11 14:24:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:24:17,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:24:17,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:24:17,083 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 4 states. [2018-04-11 14:24:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:17,333 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-04-11 14:24:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:24:17,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 14:24:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:17,344 INFO L225 Difference]: With dead ends: 202 [2018-04-11 14:24:17,344 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 14:24:17,345 INFO L567 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-04-11 14:24:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 14:24:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2018-04-11 14:24:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 14:24:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-04-11 14:24:17,377 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 17 [2018-04-11 14:24:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:17,378 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-04-11 14:24:17,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:24:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-04-11 14:24:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 14:24:17,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:17,378 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:17,378 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -383275973, now seen corresponding path program 1 times [2018-04-11 14:24:17,379 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:17,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:17,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-04-11 14:24:17,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:17,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 14:24:17,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,434 INFO L182 omatonBuilderFactory]: Interpolants [461#true, 462#false, 463#(= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|))] [2018-04-11 14:24:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 14:24:17,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 14:24:17,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 14:24:17,436 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 3 states. [2018-04-11 14:24:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:17,548 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-04-11 14:24:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 14:24:17,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 14:24:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:17,550 INFO L225 Difference]: With dead ends: 188 [2018-04-11 14:24:17,550 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 14:24:17,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04-11 14:24:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 14:24:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2018-04-11 14:24:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 14:24:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-04-11 14:24:17,559 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 17 [2018-04-11 14:24:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:17,559 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-04-11 14:24:17,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 14:24:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-04-11 14:24:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 14:24:17,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:17,560 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:17,561 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash -383275972, now seen corresponding path program 1 times [2018-04-11 14:24:17,561 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:17,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:17,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:24:17,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,616 INFO L182 omatonBuilderFactory]: Interpolants [774#true, 775#false, 776#(and (= 0 |main_#t~malloc0.offset|) (= 10 (select |#length| |main_#t~malloc0.base|))), 777#(and (= 10 (select |#length| main_~p~0.base)) (= main_~p~0.offset 0))] [2018-04-11 14:24:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:24:17,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:24:17,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:24:17,616 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 4 states. [2018-04-11 14:24:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:17,723 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-11 14:24:17,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:24:17,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 14:24:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:17,725 INFO L225 Difference]: With dead ends: 100 [2018-04-11 14:24:17,725 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 14:24:17,725 INFO L567 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-04-11 14:24:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 14:24:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 14:24:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 14:24:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 14:24:17,730 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 17 [2018-04-11 14:24:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:17,731 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 14:24:17,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:24:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 14:24:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 14:24:17,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:17,731 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:17,731 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash -383275971, now seen corresponding path program 1 times [2018-04-11 14:24:17,732 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:17,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:17,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 14:24:17,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,783 INFO L182 omatonBuilderFactory]: Interpolants [980#true, 981#false, 982#(and (= 10 (select |#length| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0))] [2018-04-11 14:24:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 14:24:17,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 14:24:17,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 14:24:17,784 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 3 states. [2018-04-11 14:24:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:17,807 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-04-11 14:24:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 14:24:17,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 14:24:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:17,808 INFO L225 Difference]: With dead ends: 99 [2018-04-11 14:24:17,809 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 14:24:17,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 14:24:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 14:24:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-11 14:24:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 14:24:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-11 14:24:17,814 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 17 [2018-04-11 14:24:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:17,814 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-11 14:24:17,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 14:24:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-11 14:24:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 14:24:17,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:17,815 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:17,815 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:17,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1560963691, now seen corresponding path program 1 times [2018-04-11 14:24:17,816 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:17,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:17,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:24:17,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,860 INFO L182 omatonBuilderFactory]: Interpolants [1184#(not (= |#Ultimate.C_memcpy_size| 10)), 1181#true, 1182#false, 1183#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10)))] [2018-04-11 14:24:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:24:17,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:24:17,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:24:17,861 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-04-11 14:24:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:17,870 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-04-11 14:24:17,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:24:17,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-11 14:24:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:17,871 INFO L225 Difference]: With dead ends: 102 [2018-04-11 14:24:17,872 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 14:24:17,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:24:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 14:24:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 14:24:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 14:24:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 14:24:17,876 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2018-04-11 14:24:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:17,877 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 14:24:17,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:24:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 14:24:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 14:24:17,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:17,878 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:17,878 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash 730350873, now seen corresponding path program 1 times [2018-04-11 14:24:17,879 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:17,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:17,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 14:24:17,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,931 INFO L182 omatonBuilderFactory]: Interpolants [1387#true, 1388#false, 1389#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1390#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 1391#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:24:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:17,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:24:17,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:24:17,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:24:17,932 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 5 states. [2018-04-11 14:24:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:17,948 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-04-11 14:24:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:24:17,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 14:24:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:17,955 INFO L225 Difference]: With dead ends: 103 [2018-04-11 14:24:17,955 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 14:24:17,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:24:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 14:24:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-04-11 14:24:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 14:24:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-04-11 14:24:17,959 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 30 [2018-04-11 14:24:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:17,959 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-04-11 14:24:17,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:24:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-04-11 14:24:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 14:24:17,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:17,960 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:17,960 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash 751157291, now seen corresponding path program 2 times [2018-04-11 14:24:17,961 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:17,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 14:24:18,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,018 INFO L182 omatonBuilderFactory]: Interpolants [1600#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 1601#(not (= |#Ultimate.C_memcpy_size| 10)), 1596#true, 1597#false, 1598#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1599#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10)))] [2018-04-11 14:24:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:24:18,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:24:18,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:24:18,018 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 6 states. [2018-04-11 14:24:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,035 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-04-11 14:24:18,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:24:18,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 14:24:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,036 INFO L225 Difference]: With dead ends: 104 [2018-04-11 14:24:18,036 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 14:24:18,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:24:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 14:24:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-11 14:24:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 14:24:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-11 14:24:18,040 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2018-04-11 14:24:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,040 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-11 14:24:18,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:24:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-11 14:24:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 14:24:18,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,041 INFO L355 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:18,041 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1396156249, now seen corresponding path program 3 times [2018-04-11 14:24:18,042 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:18,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 14:24:18,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,106 INFO L182 omatonBuilderFactory]: Interpolants [1808#true, 1809#false, 1810#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1811#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 1812#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 1813#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 1814#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:24:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 14:24:18,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 14:24:18,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:24:18,107 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-04-11 14:24:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,127 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-11 14:24:18,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:24:18,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-11 14:24:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,129 INFO L225 Difference]: With dead ends: 105 [2018-04-11 14:24:18,129 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 14:24:18,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:24:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 14:24:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-11 14:24:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 14:24:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-11 14:24:18,133 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2018-04-11 14:24:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,133 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-11 14:24:18,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 14:24:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-11 14:24:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:24:18,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,134 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 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-04-11 14:24:18,134 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,135 INFO L82 PathProgramCache]: Analyzing trace with hash -83712533, now seen corresponding path program 4 times [2018-04-11 14:24:18,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:18,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 14:24:18,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,216 INFO L182 omatonBuilderFactory]: Interpolants [2023#true, 2024#false, 2025#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2026#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2027#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2028#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2029#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2030#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:24:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 14:24:18,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 14:24:18,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:24:18,217 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 8 states. [2018-04-11 14:24:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,232 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-04-11 14:24:18,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 14:24:18,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 14:24:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,233 INFO L225 Difference]: With dead ends: 106 [2018-04-11 14:24:18,233 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 14:24:18,233 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:24:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 14:24:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 14:24:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 14:24:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-04-11 14:24:18,235 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2018-04-11 14:24:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,235 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-04-11 14:24:18,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 14:24:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-04-11 14:24:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 14:24:18,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,236 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 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-04-11 14:24:18,236 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1284995481, now seen corresponding path program 5 times [2018-04-11 14:24:18,237 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:18,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 14:24:18,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,344 INFO L182 omatonBuilderFactory]: Interpolants [2241#true, 2242#false, 2243#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2244#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2245#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2246#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2247#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2248#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2249#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:24:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:24:18,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:24:18,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:24:18,345 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-04-11 14:24:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,369 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-11 14:24:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 14:24:18,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-11 14:24:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,371 INFO L225 Difference]: With dead ends: 107 [2018-04-11 14:24:18,371 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 14:24:18,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:24:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 14:24:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-11 14:24:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 14:24:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-11 14:24:18,374 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 34 [2018-04-11 14:24:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,374 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-11 14:24:18,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:24:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-11 14:24:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 14:24:18,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,375 INFO L355 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 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-04-11 14:24:18,375 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash 765270955, now seen corresponding path program 6 times [2018-04-11 14:24:18,376 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:18,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 14:24:18,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,473 INFO L182 omatonBuilderFactory]: Interpolants [2464#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2465#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2466#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2467#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2468#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2469#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2470#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 2471#(not (= |#Ultimate.C_memcpy_size| 10)), 2462#true, 2463#false] [2018-04-11 14:24:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 14:24:18,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 14:24:18,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:24:18,474 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 10 states. [2018-04-11 14:24:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,503 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-11 14:24:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 14:24:18,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-04-11 14:24:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,505 INFO L225 Difference]: With dead ends: 108 [2018-04-11 14:24:18,505 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 14:24:18,506 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:24:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 14:24:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-04-11 14:24:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 14:24:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-04-11 14:24:18,509 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-04-11 14:24:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,509 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-04-11 14:24:18,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 14:24:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-04-11 14:24:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 14:24:18,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,510 INFO L355 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 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-04-11 14:24:18,510 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679833, now seen corresponding path program 7 times [2018-04-11 14:24:18,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:18,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 14:24:18,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,618 INFO L182 omatonBuilderFactory]: Interpolants [2688#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2689#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2690#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2691#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2692#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2693#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2694#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 2695#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 7)), 2696#(not (= |#Ultimate.C_memcpy_size| 10)), 2686#true, 2687#false] [2018-04-11 14:24:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 14:24:18,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 14:24:18,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:24:18,619 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 11 states. [2018-04-11 14:24:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,646 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-04-11 14:24:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 14:24:18,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-04-11 14:24:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,648 INFO L225 Difference]: With dead ends: 109 [2018-04-11 14:24:18,648 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 14:24:18,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:24:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 14:24:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-04-11 14:24:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 14:24:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-04-11 14:24:18,651 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2018-04-11 14:24:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,651 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-04-11 14:24:18,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 14:24:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-04-11 14:24:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 14:24:18,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,652 INFO L355 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 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-04-11 14:24:18,652 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash 594616683, now seen corresponding path program 8 times [2018-04-11 14:24:18,653 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:18,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 14:24:18,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,752 INFO L182 omatonBuilderFactory]: Interpolants [2913#true, 2914#false, 2915#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2916#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2917#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2918#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2919#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2920#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2921#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 2922#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 7)), 2923#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 8)), 2924#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:24:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 14:24:18,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 14:24:18,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-11 14:24:18,753 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 12 states. [2018-04-11 14:24:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,774 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-04-11 14:24:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 14:24:18,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-04-11 14:24:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,784 INFO L225 Difference]: With dead ends: 110 [2018-04-11 14:24:18,784 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 14:24:18,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-11 14:24:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 14:24:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-11 14:24:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 14:24:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-04-11 14:24:18,788 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2018-04-11 14:24:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,789 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-04-11 14:24:18,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 14:24:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-04-11 14:24:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 14:24:18,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,796 INFO L355 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 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-04-11 14:24:18,796 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash 838364697, now seen corresponding path program 9 times [2018-04-11 14:24:18,797 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:18,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:18,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 14:24:18,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,925 INFO L182 omatonBuilderFactory]: Interpolants [3143#true, 3144#false, 3145#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 3146#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 3147#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 3148#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 3149#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 3150#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 3151#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 3152#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 7)), 3153#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 8)), 3154#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 9)), 3155#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:24:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:18,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 14:24:18,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 14:24:18,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:24:18,926 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 13 states. [2018-04-11 14:24:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:18,949 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-04-11 14:24:18,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 14:24:18,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-04-11 14:24:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:18,950 INFO L225 Difference]: With dead ends: 111 [2018-04-11 14:24:18,950 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 14:24:18,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:24:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 14:24:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-04-11 14:24:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 14:24:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-04-11 14:24:18,956 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2018-04-11 14:24:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:18,956 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-04-11 14:24:18,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 14:24:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-04-11 14:24:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 14:24:18,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:18,957 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 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-04-11 14:24:18,957 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:18,957 INFO L82 PathProgramCache]: Analyzing trace with hash -195381461, now seen corresponding path program 10 times [2018-04-11 14:24:18,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:19,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:19,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 14:24:19,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,486 INFO L182 omatonBuilderFactory]: Interpolants [3392#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 8 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3393#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (not (= 0 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))))), 3394#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3395#(= 0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 3396#(= |main_#t~mem2| 0), 3376#true, 3377#false, 3378#(= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0), 3379#(and (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 3380#(and (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|)) (= |main_#t~malloc0.offset| 0) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 3381#(and (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 3382#(= |#memory_int| |old(#memory_int)|), 3383#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|)), 3384#(or (and (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#memory_int| |old(#memory_int)|))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3385#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)))), 3386#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 2 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2))), 3387#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 3 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3388#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 4 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)))), 3389#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 5 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3390#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 6 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3391#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 7 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))] [2018-04-11 14:24:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 14:24:19,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 14:24:19,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-04-11 14:24:19,487 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 21 states. [2018-04-11 14:24:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:19,944 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-04-11 14:24:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 14:24:19,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-04-11 14:24:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:19,944 INFO L225 Difference]: With dead ends: 104 [2018-04-11 14:24:19,944 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 14:24:19,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 14:24:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 14:24:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 14:24:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 14:24:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-04-11 14:24:19,948 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 39 [2018-04-11 14:24:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:19,948 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-04-11 14:24:19,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 14:24:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-04-11 14:24:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 14:24:19,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:19,949 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 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-04-11 14:24:19,949 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash -950455689, now seen corresponding path program 1 times [2018-04-11 14:24:19,950 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:19,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:20,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:20,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,568 INFO L182 omatonBuilderFactory]: Interpolants [3648#(or (and (<= 5 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3649#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 6 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))))), 3650#(or (and (<= 7 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3651#(or (and (<= 8 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3652#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (not (= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 1)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))))), 3653#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 3654#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| main_~p~0.base) 1))), 3655#(and (= |main_#t~mem3| 3) (= 0 main_~p~0.offset)), 3656#(= 1 (select |#valid| main_~p~0.base)), 3635#true, 3636#false, 3637#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 3638#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (= 3 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 1)))), 3639#(and (= 0 |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|) (= 3 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 1))) (not (= |main_#t~malloc0.base| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|))), 3640#(and (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 1)))), 3641#(= |#memory_int| |old(#memory_int)|), 3642#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3643#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))) (= |#Ultimate.C_memcpy_#t~loopctr13| 0))), 3644#(or (and (< 0 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 1) (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3645#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 2 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))))), 3646#(or (and (<= 3 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3647#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 4 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (or (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))))] [2018-04-11 14:24:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:20,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:20,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:20,569 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 22 states. [2018-04-11 14:24:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:21,252 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-04-11 14:24:21,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:24:21,252 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-04-11 14:24:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:21,253 INFO L225 Difference]: With dead ends: 100 [2018-04-11 14:24:21,253 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 14:24:21,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:24:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 14:24:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-04-11 14:24:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 14:24:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-04-11 14:24:21,255 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 41 [2018-04-11 14:24:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:21,255 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-04-11 14:24:21,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-04-11 14:24:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 14:24:21,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:21,256 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-11 14:24:21,256 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash -727315325, now seen corresponding path program 1 times [2018-04-11 14:24:21,256 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:21,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:21,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:21,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,858 INFO L182 omatonBuilderFactory]: Interpolants [3904#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|))) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3905#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_#t~loopctr13| 2))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3906#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3907#(and (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 2))) (= 0 main_~p~0.offset)), 3908#(and (= |main_#t~mem4| 0) (= 0 main_~p~0.offset)), 3909#(= 1 (select |#valid| main_~p~0.base)), 3888#true, 3889#false, 3890#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 3891#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 2)))), 3892#(and (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| |main_#t~malloc0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 2)))), 3893#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 2)))), 3894#(= |#memory_int| |old(#memory_int)|), 3895#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3896#(or (and (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0))), 3897#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 1)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3898#(or (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3899#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3900#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|))) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3901#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3902#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3903#(or (and (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|))] [2018-04-11 14:24:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:21,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:21,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:21,859 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 22 states. [2018-04-11 14:24:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:22,498 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-04-11 14:24:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:24:22,498 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-11 14:24:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:22,499 INFO L225 Difference]: With dead ends: 95 [2018-04-11 14:24:22,499 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 14:24:22,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:24:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 14:24:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-04-11 14:24:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-11 14:24:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-04-11 14:24:22,501 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 43 [2018-04-11 14:24:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:22,501 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-04-11 14:24:22,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-04-11 14:24:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 14:24:22,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:22,502 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-11 14:24:22,502 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1037789873, now seen corresponding path program 1 times [2018-04-11 14:24:22,503 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:22,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:23,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:23,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:23,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:23,140 INFO L182 omatonBuilderFactory]: Interpolants [4131#true, 4132#false, 4133#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4134#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 3)))), 4135#(and (= 0 |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| |main_#t~malloc0.base|)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 3)))), 4136#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 3)))), 4137#(= |#memory_int| |old(#memory_int)|), 4138#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4139#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4140#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 1)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4141#(or (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4142#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4143#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (<= 4 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4144#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (<= 5 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4145#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (<= 6 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4146#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (<= 7 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4147#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (<= 8 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4148#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (not (= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 3))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4149#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4150#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| main_~p~0.base) 3))), 4151#(= |main_#t~mem5| 0), 4152#(= 1 (select |#valid| main_~p~0.base))] [2018-04-11 14:24:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:23,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:23,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:23,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:23,141 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 22 states. [2018-04-11 14:24:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:23,806 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-04-11 14:24:23,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:24:23,806 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-04-11 14:24:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:23,807 INFO L225 Difference]: With dead ends: 90 [2018-04-11 14:24:23,807 INFO L226 Difference]: Without dead ends: 90 [2018-04-11 14:24:23,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=1204, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:24:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-11 14:24:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-04-11 14:24:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 14:24:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-04-11 14:24:23,808 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 45 [2018-04-11 14:24:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:23,809 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-04-11 14:24:23,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-04-11 14:24:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 14:24:23,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:23,809 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-11 14:24:23,809 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1243880667, now seen corresponding path program 1 times [2018-04-11 14:24:23,810 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:23,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:24,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:24,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:24,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:24,420 INFO L182 omatonBuilderFactory]: Interpolants [4384#(and (= 0 main_~p~0.offset) (= |main_#t~mem6| 0)), 4385#(= 1 (select |#valid| main_~p~0.base)), 4364#true, 4365#false, 4366#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4367#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 4))) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4368#(and (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| |main_#t~malloc0.base|)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 4))) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4369#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 4))) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4370#(= |#memory_int| |old(#memory_int)|), 4371#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4372#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0))), 4373#(or (and (or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 1)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 4374#(or (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)))) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 4375#(or (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 4376#(or (and (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 4377#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|))) (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|) (<= |#Ultimate.C_memcpy_#t~loopctr13| 5))), 4378#(or (and (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4379#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|))) (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|))), 4380#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4381#(or (and (not (= |#Ultimate.C_memcpy_#t~loopctr13| 4)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4382#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4383#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 4))))] [2018-04-11 14:24:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:24,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:24,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:24,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:24,421 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 22 states. [2018-04-11 14:24:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:25,110 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-11 14:24:25,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:24:25,110 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-04-11 14:24:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:25,110 INFO L225 Difference]: With dead ends: 85 [2018-04-11 14:24:25,110 INFO L226 Difference]: Without dead ends: 85 [2018-04-11 14:24:25,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:24:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-11 14:24:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-04-11 14:24:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 14:24:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-11 14:24:25,112 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 47 [2018-04-11 14:24:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:25,112 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-11 14:24:25,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-11 14:24:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 14:24:25,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:25,113 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-11 14:24:25,113 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash -799018201, now seen corresponding path program 1 times [2018-04-11 14:24:25,113 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:25,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:25,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:25,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:25,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:25,580 INFO L182 omatonBuilderFactory]: Interpolants [4608#(= 1 (select |#valid| main_~p~0.base)), 4587#true, 4588#false, 4589#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4590#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 5))) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4591#(and (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| |main_#t~malloc0.base|)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 5))) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4592#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 5))) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4593#(= |#memory_int| |old(#memory_int)|), 4594#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4595#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0))), 4596#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 1)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4597#(or (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4598#(or (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4599#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4600#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|) (<= |#Ultimate.C_memcpy_#t~loopctr13| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4601#(or (and (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 5)))))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4602#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 5)))))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4603#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 5))))) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4604#(or (and (not (= 5 |#Ultimate.C_memcpy_#t~loopctr13|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 5)))))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4605#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 5))))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4606#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 5)))), 4607#(and (= 0 main_~p~0.offset) (= |main_#t~mem7| 0))] [2018-04-11 14:24:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:25,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:25,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:25,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:25,581 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 22 states. [2018-04-11 14:24:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:26,153 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-04-11 14:24:26,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:24:26,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-04-11 14:24:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:26,154 INFO L225 Difference]: With dead ends: 80 [2018-04-11 14:24:26,154 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 14:24:26,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:24:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 14:24:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-04-11 14:24:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 14:24:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-04-11 14:24:26,156 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 49 [2018-04-11 14:24:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:26,156 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-04-11 14:24:26,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-04-11 14:24:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 14:24:26,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:26,157 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-11 14:24:26,157 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1224775629, now seen corresponding path program 1 times [2018-04-11 14:24:26,157 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:26,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:26,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:26,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:26,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:26,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-04-11 14:24:26,628 INFO L182 omatonBuilderFactory]: Interpolants [4800#true, 4801#false, 4802#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4803#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 6))) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4804#(and (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 6))) (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| |main_#t~malloc0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4805#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 6))) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 4806#(= |#memory_int| |old(#memory_int)|), 4807#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4808#(or (and (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0))), 4809#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 1)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4810#(or (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4811#(or (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4812#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4813#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|) (<= |#Ultimate.C_memcpy_#t~loopctr13| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4814#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (<= |#Ultimate.C_memcpy_#t~loopctr13| 6)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4815#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6)))))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4816#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6))))) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4817#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6))))) (not (= 6 |#Ultimate.C_memcpy_#t~loopctr13|))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4818#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6))))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4819#(and (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 6))) (= 0 main_~p~0.offset)), 4820#(and (= |main_#t~mem8| 0) (= 0 main_~p~0.offset)), 4821#(= 1 (select |#valid| main_~p~0.base))] [2018-04-11 14:24:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:26,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:26,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:26,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:26,629 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 22 states. [2018-04-11 14:24:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:27,231 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-04-11 14:24:27,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:24:27,231 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-04-11 14:24:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:27,232 INFO L225 Difference]: With dead ends: 75 [2018-04-11 14:24:27,232 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 14:24:27,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:24:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 14:24:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-04-11 14:24:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 14:24:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-04-11 14:24:27,234 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 51 [2018-04-11 14:24:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:27,234 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-04-11 14:24:27,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-04-11 14:24:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 14:24:27,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:27,235 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-11 14:24:27,235 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:24:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1939196927, now seen corresponding path program 1 times [2018-04-11 14:24:27,236 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:24:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:24:27,303 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 14:24:27,315 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2018-04-11 14:24:27,322 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,322 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,322 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,322 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,323 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,323 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,323 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,323 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,323 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,323 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,324 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,324 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,324 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,324 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,324 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,324 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-11 14:24:27,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 02:24:27 BoogieIcfgContainer [2018-04-11 14:24:27,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 14:24:27,333 INFO L168 Benchmark]: Toolchain (without parser) took 11026.01 ms. Allocated memory was 401.1 MB in the beginning and 869.8 MB in the end (delta: 468.7 MB). Free memory was 339.1 MB in the beginning and 787.4 MB in the end (delta: -448.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:27,334 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.1 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:24:27,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.10 ms. Allocated memory is still 401.1 MB. Free memory was 338.5 MB in the beginning and 327.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:27,334 INFO L168 Benchmark]: Boogie Preprocessor took 28.41 ms. Allocated memory is still 401.1 MB. Free memory was 327.9 MB in the beginning and 325.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:27,335 INFO L168 Benchmark]: RCFGBuilder took 377.40 ms. Allocated memory was 401.1 MB in the beginning and 611.8 MB in the end (delta: 210.8 MB). Free memory was 325.2 MB in the beginning and 563.2 MB in the end (delta: -238.0 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:27,335 INFO L168 Benchmark]: TraceAbstraction took 10453.97 ms. Allocated memory was 611.8 MB in the beginning and 869.8 MB in the end (delta: 257.9 MB). Free memory was 563.2 MB in the beginning and 787.4 MB in the end (delta: -224.1 MB). Peak memory consumption was 33.8 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:27,336 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.14 ms. Allocated memory is still 401.1 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.10 ms. Allocated memory is still 401.1 MB. Free memory was 338.5 MB in the beginning and 327.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.41 ms. Allocated memory is still 401.1 MB. Free memory was 327.9 MB in the beginning and 325.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 377.40 ms. Allocated memory was 401.1 MB in the beginning and 611.8 MB in the end (delta: 210.8 MB). Free memory was 325.2 MB in the beginning and 563.2 MB in the end (delta: -238.0 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10453.97 ms. Allocated memory was 611.8 MB in the beginning and 869.8 MB in the end (delta: 257.9 MB). Free memory was 563.2 MB in the beginning and 787.4 MB in the end (delta: -224.1 MB). Peak memory consumption was 33.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 66]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L39] struct B *p; VAL [d={18:0}] [L40] EXPR, FCALL malloc(sizeof(struct B)) VAL [d={18:0}, malloc(sizeof(struct B))={11:0}] [L40] p = malloc(sizeof(struct B)) VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}] [L41] FCALL memcpy(p, &d, sizeof(struct B)) VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, memcpy(p, &d, sizeof(struct B))={11:0}, p={11:0}] [L42] EXPR, FCALL p->a VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->a=0] [L42] COND FALSE !(p->a != 0) [L45] EXPR, FCALL p->b VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->b=3] [L45] COND FALSE !(p->b != 3) [L48] EXPR, FCALL p->c VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->c=0] [L48] COND FALSE !(p->c != 0) [L51] EXPR, FCALL p->d VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->d=0] [L51] COND FALSE !(p->d != 0) [L54] EXPR, FCALL p->e VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->e=0] [L54] COND FALSE !(p->e != 0) [L57] EXPR, FCALL p->f VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->f=0] [L57] COND FALSE !(p->f != 0) [L60] EXPR, FCALL p->f1 VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->f1=0] [L60] COND FALSE !(p->f1 != 0) [L63] EXPR, FCALL p->f2 VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}, p->f2=-255] [L63] COND TRUE p->f2 != 0 [L64] free(p) VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}] [L64] free(p) VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}] [L64] FCALL free(p) VAL [d={18:0}, malloc(sizeof(struct B))={11:0}, p={11:0}] [L66] FCALL p->f3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 127 locations, 47 error locations. UNSAFE Result, 10.4s OverallTime, 22 OverallIterations, 10 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1420 SDtfs, 2590 SDslu, 5722 SDs, 0 SdLazy, 5071 SolverSat, 598 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 72 SyntacticMatches, 16 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 49/550 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 148 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 259121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 49/550 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-24-27-342.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_14-24-27-342.csv Received shutdown request...