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-2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 14:23:51,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 14:23:51,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 14:23:51,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 14:23:51,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 14:23:51,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 14:23:51,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 14:23:51,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 14:23:51,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 14:23:51,117 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 14:23:51,118 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 14:23:51,118 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 14:23:51,119 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 14:23:51,120 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 14:23:51,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 14:23:51,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 14:23:51,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 14:23:51,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 14:23:51,125 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 14:23:51,126 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 14:23:51,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 14:23:51,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 14:23:51,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 14:23:51,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 14:23:51,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 14:23:51,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 14:23:51,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 14:23:51,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 14:23:51,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 14:23:51,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 14:23:51,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 14:23:51,132 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:23:51,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 14:23:51,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 14:23:51,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 14:23:51,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 14:23:51,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 14:23:51,152 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 14:23:51,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 14:23:51,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 14:23:51,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 14:23:51,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 14:23:51,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 14:23:51,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 14:23:51,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:23:51,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 14:23:51,153 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:23:51,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 14:23:51,188 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 14:23:51,191 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 14:23:51,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 14:23:51,192 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 14:23:51,193 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-2_true-valid-memsafety_true-termination.i [2018-04-11 14:23:51,533 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG014d62154 [2018-04-11 14:23:51,626 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 14:23:51,626 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 14:23:51,627 INFO L168 CDTParser]: Scanning test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 14:23:51,627 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 14:23:51,628 INFO L215 ultiparseSymbolTable]: [2018-04-11 14:23:51,628 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 14:23:51,628 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 14:23:51,628 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 14:23:51,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 14:23:51,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 14:23:51,640 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG014d62154 [2018-04-11 14:23:51,643 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 14:23:51,644 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 14:23:51,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 14:23:51,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 14:23:51,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 14:23:51,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77aa1839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51, skipping insertion in model container [2018-04-11 14:23:51,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,669 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:23:51,677 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:23:51,781 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:23:51,799 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:23:51,803 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 14:23:51,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51 WrapperNode [2018-04-11 14:23:51,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 14:23:51,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 14:23:51,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 14:23:51,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 14:23:51,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (1/1) ... [2018-04-11 14:23:51,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 14:23:51,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 14:23:51,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 14:23:51,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 14:23:51,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (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:23:51,878 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 14:23:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 14:23:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 14:23:51,879 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 14:23:51,879 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 14:23:51,880 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 14:23:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 14:23:51,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 14:23:52,168 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 14:23:52,200 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 14:23:52,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:23:52 BoogieIcfgContainer [2018-04-11 14:23:52,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 14:23:52,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 14:23:52,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 14:23:52,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 14:23:52,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 02:23:51" (1/3) ... [2018-04-11 14:23:52,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad0d66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:23:52, skipping insertion in model container [2018-04-11 14:23:52,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:51" (2/3) ... [2018-04-11 14:23:52,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad0d66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:23:52, skipping insertion in model container [2018-04-11 14:23:52,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:23:52" (3/3) ... [2018-04-11 14:23:52,207 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 14:23:52,213 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 14:23:52,217 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-11 14:23:52,244 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 14:23:52,245 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 14:23:52,245 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 14:23:52,245 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 14:23:52,245 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 14:23:52,245 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 14:23:52,246 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 14:23:52,246 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 14:23:52,246 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 14:23:52,246 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 14:23:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2018-04-11 14:23:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 14:23:52,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:52,268 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:52,268 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2048667359, now seen corresponding path program 1 times [2018-04-11 14:23:52,302 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:52,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:52,484 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:23:52,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:52,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:23:52,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:52,487 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:23:52,487 INFO L182 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (= (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 1)), 101#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 102#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)))] [2018-04-11 14:23:52,487 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:23:52,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:23:52,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:23:52,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:23:52,497 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2018-04-11 14:23:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:52,692 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-11 14:23:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:23:52,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 14:23:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:52,704 INFO L225 Difference]: With dead ends: 124 [2018-04-11 14:23:52,704 INFO L226 Difference]: Without dead ends: 121 [2018-04-11 14:23:52,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:23:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-11 14:23:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2018-04-11 14:23:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 14:23:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-04-11 14:23:52,736 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 15 [2018-04-11 14:23:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:52,736 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-04-11 14:23:52,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:23:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-04-11 14:23:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:23:52,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:52,737 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] [2018-04-11 14:23:52,738 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781157, now seen corresponding path program 1 times [2018-04-11 14:23:52,739 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:52,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:52,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:52,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:23:52,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:52,795 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:23:52,795 INFO L182 omatonBuilderFactory]: Interpolants [309#true, 310#false, 311#(and (= 0 |main_#t~malloc0.offset|) (= 4 (select |#length| |main_#t~malloc0.base|))), 312#(and (= main_~p~0.offset 0) (= 4 (select |#length| main_~p~0.base)))] [2018-04-11 14:23:52,795 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:23:52,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:23:52,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:23:52,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:23:52,797 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 4 states. [2018-04-11 14:23:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:52,860 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-04-11 14:23:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:23:52,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 14:23:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:52,861 INFO L225 Difference]: With dead ends: 58 [2018-04-11 14:23:52,861 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 14:23:52,862 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:23:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 14:23:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-11 14:23:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 14:23:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-04-11 14:23:52,865 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 20 [2018-04-11 14:23:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:52,865 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-04-11 14:23:52,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:23:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-04-11 14:23:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:23:52,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:52,866 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] [2018-04-11 14:23:52,866 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:52,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781159, now seen corresponding path program 1 times [2018-04-11 14:23:52,866 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:52,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:52,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:52,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:23:52,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:52,899 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:23:52,899 INFO L182 omatonBuilderFactory]: Interpolants [432#false, 433#(= 1 (select |#valid| |main_#t~malloc0.base|)), 434#(= 1 (select |#valid| main_~p~0.base)), 431#true] [2018-04-11 14:23:52,899 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:23:52,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:23:52,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:23:52,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:23:52,900 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2018-04-11 14:23:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:52,955 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-04-11 14:23:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:23:52,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 14:23:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:52,956 INFO L225 Difference]: With dead ends: 73 [2018-04-11 14:23:52,956 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 14:23:52,956 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:23:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 14:23:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-04-11 14:23:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 14:23:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-04-11 14:23:52,958 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 20 [2018-04-11 14:23:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:52,958 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-04-11 14:23:52,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:23:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-04-11 14:23:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 14:23:52,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:52,959 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, 1, 1] [2018-04-11 14:23:52,959 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2114791798, now seen corresponding path program 1 times [2018-04-11 14:23:52,960 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:52,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:53,021 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:23:53,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:53,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:23:53,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:53,022 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:23:53,022 INFO L182 omatonBuilderFactory]: Interpolants [566#true, 567#false, 568#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 569#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-04-11 14:23:53,023 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:23:53,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:23:53,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:23:53,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:23:53,023 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2018-04-11 14:23:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:53,031 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-11 14:23:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:23:53,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-11 14:23:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:53,032 INFO L225 Difference]: With dead ends: 59 [2018-04-11 14:23:53,032 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 14:23:53,032 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:23:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 14:23:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-11 14:23:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 14:23:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-04-11 14:23:53,036 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 32 [2018-04-11 14:23:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:53,036 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-04-11 14:23:53,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:23:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-04-11 14:23:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:23:53,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:53,037 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, 1, 1, 1] [2018-04-11 14:23:53,037 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1008408557, now seen corresponding path program 1 times [2018-04-11 14:23:53,038 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:53,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:23:53,094 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:23:53,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:53,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 14:23:53,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:53,095 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:23:53,095 INFO L182 omatonBuilderFactory]: Interpolants [688#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 689#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 690#(not (= |#Ultimate.C_memcpy_size| 4)), 686#true, 687#false] [2018-04-11 14:23:53,095 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:23:53,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:23:53,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:23:53,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:23:53,095 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2018-04-11 14:23:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:53,104 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-11 14:23:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:23:53,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-11 14:23:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:53,105 INFO L225 Difference]: With dead ends: 60 [2018-04-11 14:23:53,105 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 14:23:53,105 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:23:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 14:23:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-11 14:23:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 14:23:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-04-11 14:23:53,107 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 33 [2018-04-11 14:23:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:53,108 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-04-11 14:23:53,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:23:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-04-11 14:23:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 14:23:53,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:53,108 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, 1, 1, 1] [2018-04-11 14:23:53,108 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash -956628246, now seen corresponding path program 2 times [2018-04-11 14:23:53,109 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:53,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:53,168 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:23:53,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:53,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 14:23:53,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:53,169 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:23:53,169 INFO L182 omatonBuilderFactory]: Interpolants [809#true, 810#false, 811#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 812#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 813#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 2) (not (= |#Ultimate.C_memcpy_size| 4))), 814#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-04-11 14:23:53,169 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:23:53,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:23:53,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:23:53,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:23:53,170 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-04-11 14:23:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:53,185 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-04-11 14:23:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:23:53,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-11 14:23:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:53,186 INFO L225 Difference]: With dead ends: 61 [2018-04-11 14:23:53,186 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 14:23:53,186 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:23:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 14:23:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-04-11 14:23:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-11 14:23:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-04-11 14:23:53,189 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2018-04-11 14:23:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:53,189 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-04-11 14:23:53,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:23:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-04-11 14:23:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 14:23:53,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:53,190 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, 1, 1, 1] [2018-04-11 14:23:53,190 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1743226995, now seen corresponding path program 3 times [2018-04-11 14:23:53,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:53,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:53,299 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:23:53,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:53,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 14:23:53,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:53,299 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:23:53,300 INFO L182 omatonBuilderFactory]: Interpolants [935#true, 936#false, 937#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 938#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 939#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 2) (not (= |#Ultimate.C_memcpy_size| 4))), 940#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 3) (not (= |#Ultimate.C_memcpy_size| 4))), 941#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-04-11 14:23:53,300 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:23:53,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 14:23:53,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 14:23:53,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:23:53,300 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 7 states. [2018-04-11 14:23:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:53,316 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-04-11 14:23:53,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:23:53,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-04-11 14:23:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:53,319 INFO L225 Difference]: With dead ends: 62 [2018-04-11 14:23:53,319 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 14:23:53,320 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:23:53,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 14:23:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-04-11 14:23:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 14:23:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-11 14:23:53,324 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 35 [2018-04-11 14:23:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:53,324 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-11 14:23:53,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 14:23:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-11 14:23:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 14:23:53,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:53,325 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, 1, 1, 1] [2018-04-11 14:23:53,326 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -357984438, now seen corresponding path program 4 times [2018-04-11 14:23:53,326 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:53,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:53,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:53,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:23:53,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:53,672 INFO L182 omatonBuilderFactory]: Interpolants [1064#true, 1065#false, 1066#(= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|), 1067#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= |main_#t~malloc0.offset| 0)), 1068#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset)), 1069#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|)) (= 0 main_~p~0.offset)), 1070#(= |#memory_int| |old(#memory_int)|), 1071#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|)), 1072#(or (and (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#memory_int| |old(#memory_int)|))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1073#(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)) (<= 1 (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|)))), 1074#(or (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_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1075#(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 (= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 0)))), 1076#(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))), 1077#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 1078#(= |main_#t~mem2| 1)] [2018-04-11 14:23:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:53,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 14:23:53,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 14:23:53,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-11 14:23:53,673 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 15 states. [2018-04-11 14:23:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:53,953 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-04-11 14:23:53,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 14:23:53,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-04-11 14:23:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:53,954 INFO L225 Difference]: With dead ends: 55 [2018-04-11 14:23:53,954 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 14:23:53,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-04-11 14:23:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 14:23:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 14:23:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 14:23:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-04-11 14:23:53,958 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 36 [2018-04-11 14:23:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:53,958 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-04-11 14:23:53,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 14:23:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-04-11 14:23:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 14:23:53,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:53,959 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, 1, 1, 1, 1, 1] [2018-04-11 14:23:53,964 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1701873782, now seen corresponding path program 1 times [2018-04-11 14:23:53,965 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:53,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,399 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:23:54,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:54,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 14:23:54,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:54,400 INFO L182 omatonBuilderFactory]: Interpolants [1216#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 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|)), 1217#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= |#Ultimate.C_memcpy_#t~loopctr8| 2) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1)) (<= 2 |#Ultimate.C_memcpy_#t~loopctr8|) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1218#(or (and (<= |#Ultimate.C_memcpy_#t~loopctr8| 3) (<= 3 |#Ultimate.C_memcpy_#t~loopctr8|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1)) (= (select (select |#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)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1219#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1220#(and (= 2 (select (select |#memory_int| main_~p~0.base) 1)) (= 0 main_~p~0.offset)), 1221#(and (= |main_#t~mem3| 2) (= 0 main_~p~0.offset)), 1222#(= 1 (select |#valid| main_~p~0.base)), 1207#true, 1208#false, 1209#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 1210#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 1211#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset)), 1212#(and (= 2 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 1))) (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset)), 1213#(= |#memory_int| |old(#memory_int)|), 1214#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1215#(or (and (or (= |#memory_int| |old(#memory_int)|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= |#Ultimate.C_memcpy_#t~loopctr8| 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))] [2018-04-11 14:23:54,401 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:23:54,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:23:54,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:23:54,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:23:54,402 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 16 states. [2018-04-11 14:23:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,848 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-04-11 14:23:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 14:23:54,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-11 14:23:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,849 INFO L225 Difference]: With dead ends: 81 [2018-04-11 14:23:54,849 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 14:23:54,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-04-11 14:23:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 14:23:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2018-04-11 14:23:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 14:23:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-04-11 14:23:54,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 38 [2018-04-11 14:23:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,853 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-04-11 14:23:54,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:23:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-04-11 14:23:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 14:23:54,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,854 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, 1, 1, 1, 1, 1] [2018-04-11 14:23:54,854 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash -877857895, now seen corresponding path program 2 times [2018-04-11 14:23:54,855 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:54,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:54,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 14:23:54,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,993 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:23:54,994 INFO L182 omatonBuilderFactory]: Interpolants [1395#true, 1396#false, 1397#(and (= 0 |main_#t~malloc0.offset|) (= 4 (select |#length| |main_#t~malloc0.base|))), 1398#(and (= 0 main_~p~0.offset) (= 4 (select |#length| main_~p~0.base))), 1399#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 4)) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|) (select |#length| |#Ultimate.C_memcpy_dest.base|))), 1400#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 4)) (and (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|) (select |#length| |#Ultimate.C_memcpy_dest.base|)))), 1401#(or (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 1) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 4))), 1402#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 4)) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 2) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|))), 1403#(or (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 3) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 4))), 1404#(or (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 4) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 4))), 1405#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 4)))] [2018-04-11 14:23:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:54,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 14:23:54,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 14:23:54,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:23:54,994 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 11 states. [2018-04-11 14:23:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:55,114 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-11 14:23:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 14:23:55,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-04-11 14:23:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:55,114 INFO L225 Difference]: With dead ends: 53 [2018-04-11 14:23:55,114 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 14:23:55,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:23:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 14:23:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 14:23:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 14:23:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-04-11 14:23:55,118 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 39 [2018-04-11 14:23:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:55,118 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-04-11 14:23:55,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 14:23:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-04-11 14:23:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 14:23:55,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:55,119 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, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:55,119 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1425873007, now seen corresponding path program 1 times [2018-04-11 14:23:55,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:23:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:23:55,181 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 14:23:55,193 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2018-04-11 14:23:55,200 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,200 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,200 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,200 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,201 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,201 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,201 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,201 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,202 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,202 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,202 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,202 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-11 14:23:55,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 02:23:55 BoogieIcfgContainer [2018-04-11 14:23:55,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 14:23:55,210 INFO L168 Benchmark]: Toolchain (without parser) took 3567.17 ms. Allocated memory was 393.7 MB in the beginning and 677.4 MB in the end (delta: 283.6 MB). Free memory was 332.5 MB in the beginning and 574.8 MB in the end (delta: -242.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 5.3 GB. [2018-04-11 14:23:55,211 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 393.7 MB. Free memory is still 353.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:23:55,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.47 ms. Allocated memory is still 393.7 MB. Free memory was 332.5 MB in the beginning and 321.8 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:23:55,212 INFO L168 Benchmark]: Boogie Preprocessor took 27.52 ms. Allocated memory is still 393.7 MB. Free memory was 321.8 MB in the beginning and 320.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 14:23:55,212 INFO L168 Benchmark]: RCFGBuilder took 361.61 ms. Allocated memory was 393.7 MB in the beginning and 596.1 MB in the end (delta: 202.4 MB). Free memory was 320.5 MB in the beginning and 549.8 MB in the end (delta: -229.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 5.3 GB. [2018-04-11 14:23:55,212 INFO L168 Benchmark]: TraceAbstraction took 3008.25 ms. Allocated memory was 596.1 MB in the beginning and 677.4 MB in the end (delta: 81.3 MB). Free memory was 549.8 MB in the beginning and 574.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 56.3 MB. Max. memory is 5.3 GB. [2018-04-11 14:23:55,213 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.12 ms. Allocated memory is still 393.7 MB. Free memory is still 353.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.47 ms. Allocated memory is still 393.7 MB. Free memory was 332.5 MB in the beginning and 321.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.52 ms. Allocated memory is still 393.7 MB. Free memory was 321.8 MB in the beginning and 320.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 361.61 ms. Allocated memory was 393.7 MB in the beginning and 596.1 MB in the end (delta: 202.4 MB). Free memory was 320.5 MB in the beginning and 549.8 MB in the end (delta: -229.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3008.25 ms. Allocated memory was 596.1 MB in the beginning and 677.4 MB in the end (delta: 81.3 MB). Free memory was 549.8 MB in the beginning and 574.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 56.3 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 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 6 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={7:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={7:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={7:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={7:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={7:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={7:0}] [L24] struct A *p; VAL [d={7:0}] [L25] EXPR, FCALL malloc(4) VAL [d={7:0}, malloc(4)={9:0}] [L25] p = malloc(4) VAL [d={7:0}, malloc(4)={9:0}, p={9:0}] [L26] FCALL d.a = 1 VAL [d={7:0}, malloc(4)={9:0}, p={9:0}] [L27] FCALL d.b = 2 VAL [d={7:0}, malloc(4)={9:0}, p={9:0}] [L28] FCALL d.c = 3 VAL [d={7:0}, malloc(4)={9:0}, p={9:0}] [L29] FCALL d.d = 4 VAL [d={7:0}, malloc(4)={9:0}, p={9:0}] [L30] FCALL d.e = 5 VAL [d={7:0}, malloc(4)={9:0}, p={9:0}] [L31] FCALL memcpy(p, &d, 4) VAL [d={7:0}, malloc(4)={9:0}, memcpy(p, &d, 4)={9:0}, p={9:0}] [L32] EXPR, FCALL p->a VAL [d={7:0}, malloc(4)={9:0}, p={9:0}, p->a=1] [L32] COND FALSE !(p->a != 1) [L35] EXPR, FCALL p->b VAL [d={7:0}, malloc(4)={9:0}, p={9:0}, p->b=2] [L35] COND FALSE !(p->b != 2) [L38] EXPR, FCALL p->c VAL [d={7:0}, malloc(4)={9:0}, p={9:0}, p->c=3] [L38] COND FALSE !(p->c != 3) [L41] EXPR, FCALL p->d VAL [d={7:0}, malloc(4)={9:0}, p={9:0}, p->d=4] [L41] COND FALSE !(p->d != 4) [L44] FCALL p->e - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 37 error locations. UNSAFE Result, 2.9s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 378 SDtfs, 694 SDslu, 905 SDs, 0 SdLazy, 1098 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 12/45 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, 10 MinimizatonAttempts, 76 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 49596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 12/45 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-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-23-55-220.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_14-23-55-220.csv Received shutdown request...