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_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 18:38:18,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 18:38:18,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 18:38:18,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 18:38:18,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 18:38:18,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 18:38:18,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 18:38:18,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 18:38:18,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 18:38:18,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 18:38:18,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 18:38:18,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 18:38:18,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 18:38:18,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 18:38:18,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 18:38:18,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 18:38:18,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 18:38:18,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 18:38:18,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 18:38:18,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 18:38:18,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 18:38:18,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 18:38:18,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 18:38:18,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 18:38:18,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 18:38:18,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 18:38:18,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 18:38:18,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 18:38:18,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 18:38:18,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 18:38:18,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 18:38:18,072 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-04-11 18:38:18,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 18:38:18,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 18:38:18,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 18:38:18,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 18:38:18,094 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 18:38:18,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 18:38:18,095 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 18:38:18,095 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 18:38:18,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 18:38:18,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 18:38:18,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 18:38:18,095 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 18:38:18,096 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 18:38:18,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 18:38:18,096 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 18:38:18,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 18:38:18,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 18:38:18,096 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 18:38:18,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 18:38:18,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 18:38:18,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 18:38:18,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-04-11 18:38:18,097 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-04-11 18:38:18,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 18:38:18,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 18:38:18,137 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 18:38:18,141 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 18:38:18,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 18:38:18,144 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 18:38:18,145 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.1_false-valid-free.i [2018-04-11 18:38:18,443 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG96ed23138 [2018-04-11 18:38:18,521 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 18:38:18,521 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 18:38:18,522 INFO L168 CDTParser]: Scanning test-bitfields-2.1_false-valid-free.i [2018-04-11 18:38:18,523 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 18:38:18,523 INFO L215 ultiparseSymbolTable]: [2018-04-11 18:38:18,523 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 18:38:18,523 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2.1_false-valid-free.i [2018-04-11 18:38:18,523 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 18:38:18,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__d in test-bitfields-2.1_false-valid-free.i [2018-04-11 18:38:18,524 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__size_t in test-bitfields-2.1_false-valid-free.i [2018-04-11 18:38:18,535 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG96ed23138 [2018-04-11 18:38:18,538 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 18:38:18,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 18:38:18,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 18:38:18,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 18:38:18,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 18:38:18,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a35b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18, skipping insertion in model container [2018-04-11 18:38:18,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,561 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:38:18,573 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:38:18,687 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:38:18,711 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:38:18,717 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 18:38:18,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18 WrapperNode [2018-04-11 18:38:18,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 18:38:18,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 18:38:18,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 18:38:18,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 18:38:18,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (1/1) ... [2018-04-11 18:38:18,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 18:38:18,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 18:38:18,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 18:38:18,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 18:38:18,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (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 18:38:18,802 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 18:38:18,803 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 18:38:18,803 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 18:38:18,803 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 18:38:18,803 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 18:38:18,803 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 18:38:18,803 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 18:38:18,803 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 18:38:18,803 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 18:38:18,804 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 18:38:18,804 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 18:38:18,804 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 18:38:18,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 18:38:18,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 18:38:18,804 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 18:38:18,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 18:38:19,096 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 18:38:19,124 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 18:38:19,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:38:19 BoogieIcfgContainer [2018-04-11 18:38:19,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 18:38:19,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 18:38:19,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 18:38:19,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 18:38:19,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 06:38:18" (1/3) ... [2018-04-11 18:38:19,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa65608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:38:19, skipping insertion in model container [2018-04-11 18:38:19,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:18" (2/3) ... [2018-04-11 18:38:19,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa65608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:38:19, skipping insertion in model container [2018-04-11 18:38:19,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:38:19" (3/3) ... [2018-04-11 18:38:19,132 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i [2018-04-11 18:38:19,140 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 18:38:19,148 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-11 18:38:19,178 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 18:38:19,179 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 18:38:19,179 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 18:38:19,179 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-04-11 18:38:19,180 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 18:38:19,180 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 18:38:19,180 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 18:38:19,180 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 18:38:19,180 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 18:38:19,181 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 18:38:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-04-11 18:38:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 18:38:19,196 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:19,196 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 18:38:19,197 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash -860719877, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:19,207 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:19,251 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:19,266 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,267 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,268 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,268 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 18:38:19,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 18:38:19,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 18:38:19,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-04-11 18:38:19,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:8 [2018-04-11 18:38:19,464 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,464 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,464 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,465 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:19,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 18:38:19,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 18:38:19,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 18:38:19,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-04-11 18:38:19,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:38:19,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:8 [2018-04-11 18:38:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:19,673 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 18:38:19,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:19,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 18:38:19,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:19,705 INFO L182 omatonBuilderFactory]: Interpolants [94#true, 110#(= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)), 95#false, 111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|))] [2018-04-11 18:38:19,705 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 18:38:19,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 18:38:19,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 18:38:19,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 18:38:19,721 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-04-11 18:38:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:19,954 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-11 18:38:19,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 18:38:19,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 18:38:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:19,967 INFO L225 Difference]: With dead ends: 120 [2018-04-11 18:38:19,967 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 18:38:19,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 18:38:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 18:38:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2018-04-11 18:38:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 18:38:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-04-11 18:38:20,001 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 20 [2018-04-11 18:38:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:20,001 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-04-11 18:38:20,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 18:38:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-04-11 18:38:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 18:38:20,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:20,002 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 18:38:20,002 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash -860719876, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:20,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:20,023 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-04-11 18:38:20,044 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:20,045 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:20,045 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:20,045 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:20,152 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 38 DAG size of output 37 [2018-04-11 18:38:20,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-04-11 18:38:20,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:20,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-11 18:38:20,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:20,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:38:20,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-04-11 18:38:20,191 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 18:38:20,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:38:20,207 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:141, output treesize:30 [2018-04-11 18:38:22,245 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:22,245 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:22,245 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:22,245 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:22,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:38:22,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2018-04-11 18:38:22,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 18:38:22,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-11 18:38:22,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:22,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 18:38:22,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:22,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-04-11 18:38:22,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:22,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:38:22,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:141, output treesize:30 [2018-04-11 18:38:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:32,459 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:32,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:32,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 18:38:32,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:32,511 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 18:38:32,511 INFO L182 omatonBuilderFactory]: Interpolants [336#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|)), 337#(= |old(#length)| |#length|), 338#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)) (= (store |old(#length)| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| 13) |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 316#true, 332#(and (= 0 |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)) (= 13 (select |#length| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|))), 317#false, 333#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)) (forall ((v_prenex_8 Int)) (or (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| v_prenex_8) (= 13 (select (store |#length| v_prenex_8 12) |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)))) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 334#(and (forall ((v_prenex_11 Int)) (or (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| v_prenex_11) (= 13 (select (store |#length| v_prenex_11 12) |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)))) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 335#(and (<= (+ |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 1) (select |#length| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)) (<= 0 |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset|) (= 13 (select |#length| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)))] [2018-04-11 18:38:32,512 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 18:38:32,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 18:38:32,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 18:38:32,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=43, Unknown=6, NotChecked=0, Total=72 [2018-04-11 18:38:32,514 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 9 states. [2018-04-11 18:38:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:32,706 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-04-11 18:38:32,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:38:32,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-11 18:38:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:32,707 INFO L225 Difference]: With dead ends: 111 [2018-04-11 18:38:32,707 INFO L226 Difference]: Without dead ends: 111 [2018-04-11 18:38:32,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=41, Invalid=63, Unknown=6, NotChecked=0, Total=110 [2018-04-11 18:38:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-11 18:38:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2018-04-11 18:38:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 18:38:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-04-11 18:38:32,714 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 20 [2018-04-11 18:38:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:32,715 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-04-11 18:38:32,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 18:38:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-04-11 18:38:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 18:38:32,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:32,715 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] [2018-04-11 18:38:32,716 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash -258775389, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:32,719 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:32,729 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:32,731 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,731 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,732 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,732 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,761 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true [2018-04-11 18:38:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:32,788 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 18:38:32,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:32,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:38:32,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:32,809 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 18:38:32,809 INFO L182 omatonBuilderFactory]: Interpolants [530#true, 546#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 531#false, 547#(= 1 (select |#valid| |main_#t~malloc0.base|)), 548#(= 1 (select |#valid| main_~p~0.base)), 549#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|))] [2018-04-11 18:38:32,809 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 18:38:32,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:38:32,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:38:32,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-11 18:38:32,809 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 6 states. [2018-04-11 18:38:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:32,936 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-04-11 18:38:32,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:38:32,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 18:38:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:32,938 INFO L225 Difference]: With dead ends: 106 [2018-04-11 18:38:32,938 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 18:38:32,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=28, Unknown=2, NotChecked=10, Total=56 [2018-04-11 18:38:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 18:38:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2018-04-11 18:38:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 18:38:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-04-11 18:38:32,943 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 25 [2018-04-11 18:38:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:32,943 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-04-11 18:38:32,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:38:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-04-11 18:38:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 18:38:32,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:32,944 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] [2018-04-11 18:38:32,944 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash -258775387, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:32,948 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:32,963 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:32,963 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,964 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,964 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,964 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:32,969 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 12) (store |c_#length| %1 12)) :qid itp)) :qid itp)) is different from true [2018-04-11 18:38:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,003 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 18:38:33,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:33,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:38:33,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:33,030 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 18:38:33,030 INFO L182 omatonBuilderFactory]: Interpolants [736#false, 752#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 753#(and (<= 0 main_~p~0.offset) (<= (+ main_~p~0.offset 4) (select |#length| main_~p~0.base))), 754#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|)), 735#true, 751#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 12) (store |#length| %1 12)) :qid itp)) :qid itp))] [2018-04-11 18:38:33,030 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 18:38:33,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:38:33,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:38:33,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-11 18:38:33,031 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 6 states. [2018-04-11 18:38:33,066 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#memory_int| |c_old(#memory_int)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |c_old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |c_old(#length)| |c_#length|) (= |c_~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |c_old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|) (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 12) (store |c_#length| %1 12)) :qid itp)) :qid itp))) is different from false [2018-04-11 18:38:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:33,183 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-04-11 18:38:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:38:33,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 18:38:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:33,185 INFO L225 Difference]: With dead ends: 74 [2018-04-11 18:38:33,185 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 18:38:33,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-04-11 18:38:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 18:38:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-04-11 18:38:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-11 18:38:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-04-11 18:38:33,190 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 25 [2018-04-11 18:38:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:33,190 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-04-11 18:38:33,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:38:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-04-11 18:38:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 18:38:33,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:33,191 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, 1] [2018-04-11 18:38:33,191 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2008843937, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:33,195 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:33,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:33,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 18:38:33,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:33,269 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 18:38:33,269 INFO L182 omatonBuilderFactory]: Interpolants [928#(= |#memory_int| |old(#memory_int)|), 929#(= 0 |#Ultimate.C_memcpy_#t~loopctr7|), 930#(<= |#Ultimate.C_memcpy_size| 0), 904#true, 920#(= 0 |main_#t~malloc0.offset|), 905#false, 921#(= 0 main_~p~0.offset), 927#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|))] [2018-04-11 18:38:33,269 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 18:38:33,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:38:33,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:38:33,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:38:33,269 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-04-11 18:38:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:33,380 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-04-11 18:38:33,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:38:33,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-11 18:38:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:33,381 INFO L225 Difference]: With dead ends: 69 [2018-04-11 18:38:33,381 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 18:38:33,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-11 18:38:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 18:38:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-11 18:38:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 18:38:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-04-11 18:38:33,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 34 [2018-04-11 18:38:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:33,385 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-04-11 18:38:33,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:38:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-04-11 18:38:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 18:38:33,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:33,386 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, 1, 1, 1, 1, 1] [2018-04-11 18:38:33,386 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:33,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1953371958, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:33,389 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,443 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 18:38:33,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:33,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 18:38:33,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:33,465 INFO L182 omatonBuilderFactory]: Interpolants [1077#true, 1078#false, 1099#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|)), 1100#(= |#memory_int| |old(#memory_int)|), 1101#(= 0 |#Ultimate.C_memcpy_#t~loopctr7|), 1102#(or (and (<= |#Ultimate.C_memcpy_size| 1) (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr7|)) (and (< |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_size|) (< 1 |#Ultimate.C_memcpy_size|))), 1103#(<= |#Ultimate.C_memcpy_size| 1)] [2018-04-11 18:38:33,465 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 18:38:33,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 18:38:33,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 18:38:33,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 18:38:33,465 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 7 states. [2018-04-11 18:38:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:33,596 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-11 18:38:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:38:33,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-11 18:38:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:33,597 INFO L225 Difference]: With dead ends: 70 [2018-04-11 18:38:33,597 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 18:38:33,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:38:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 18:38:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-11 18:38:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 18:38:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-04-11 18:38:33,599 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 38 [2018-04-11 18:38:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:33,599 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-04-11 18:38:33,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 18:38:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-04-11 18:38:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 18:38:33,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:33,600 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, 1, 1, 1, 1, 1] [2018-04-11 18:38:33,600 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash -357074796, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:33,603 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,645 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 18:38:33,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:33,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 18:38:33,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:33,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 18:38:33,672 INFO L182 omatonBuilderFactory]: Interpolants [1269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|)), 1270#(= |#memory_int| |old(#memory_int)|), 1271#(= 0 |#Ultimate.C_memcpy_#t~loopctr7|), 1272#(= 1 |#Ultimate.C_memcpy_#t~loopctr7|), 1273#(or (and (<= |#Ultimate.C_memcpy_size| 2) (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr7|)) (and (< |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_size|) (< 2 |#Ultimate.C_memcpy_size|))), 1274#(<= |#Ultimate.C_memcpy_size| 2), 1246#true, 1247#false] [2018-04-11 18:38:33,672 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 18:38:33,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:38:33,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:38:33,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:38:33,673 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 8 states. [2018-04-11 18:38:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:33,757 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-11 18:38:33,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:38:33,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-04-11 18:38:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:33,758 INFO L225 Difference]: With dead ends: 71 [2018-04-11 18:38:33,758 INFO L226 Difference]: Without dead ends: 69 [2018-04-11 18:38:33,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-11 18:38:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-11 18:38:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-04-11 18:38:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 18:38:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-11 18:38:33,761 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 39 [2018-04-11 18:38:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:33,761 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-11 18:38:33,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:38:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-11 18:38:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 18:38:33,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:33,763 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, 1, 1, 1, 1, 1] [2018-04-11 18:38:33,763 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1033519862, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:33,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,811 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 18:38:33,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:33,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 18:38:33,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:33,829 INFO L182 omatonBuilderFactory]: Interpolants [1443#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|)), 1444#(= |#memory_int| |old(#memory_int)|), 1445#(= 0 |#Ultimate.C_memcpy_#t~loopctr7|), 1446#(= 1 |#Ultimate.C_memcpy_#t~loopctr7|), 1447#(<= |#Ultimate.C_memcpy_#t~loopctr7| 2), 1448#(<= |#Ultimate.C_memcpy_#t~loopctr7| 3), 1449#(not (= 4 |#Ultimate.C_memcpy_size|)), 1419#true, 1420#false] [2018-04-11 18:38:33,829 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 18:38:33,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 18:38:33,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 18:38:33,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:38:33,830 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 9 states. [2018-04-11 18:38:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:33,907 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-04-11 18:38:33,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:38:33,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-04-11 18:38:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:33,908 INFO L225 Difference]: With dead ends: 72 [2018-04-11 18:38:33,908 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 18:38:33,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:38:33,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 18:38:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-11 18:38:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 18:38:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-04-11 18:38:33,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2018-04-11 18:38:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:33,911 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-04-11 18:38:33,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 18:38:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-04-11 18:38:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 18:38:33,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:33,911 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, 1, 1] [2018-04-11 18:38:33,912 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1192281300, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:33,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:33,983 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-04-11 18:38:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:34,102 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-04-11 18:38:34,130 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,132 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,132 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,132 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,132 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,132 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,179 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,179 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,180 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,180 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,180 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,180 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,181 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,181 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,181 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,181 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 166 [2018-04-11 18:38:34,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:34,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 18:38:34,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:248, output treesize:221 [2018-04-11 18:38:34,242 WARN L1011 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int (Array Int Int)))) (! (forall ((%1 Int) (%2 Int)) (! (exists ((%3 (Array Int Int))) (! (forall ((%4 Int)) (! (exists ((%6 (Array Int (Array Int Int))) (%5 (Array Int Int)) (%8 (Array Int Int)) (%7 (Array Int Int))) (! (let ((.cse0 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|)) (.cse1 (select |c_#memory_int| |c_#Ultimate.C_memcpy_src.base|))) (and (= (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 (+ |c_#Ultimate.C_memcpy_dest.offset| 3) (select .cse1 (+ |c_#Ultimate.C_memcpy_src.offset| 3)))) (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 (+ |c_#Ultimate.C_memcpy_#t~loopctr7| |c_#Ultimate.C_memcpy_dest.offset|) (select .cse1 (+ |c_#Ultimate.C_memcpy_src.offset| |c_#Ultimate.C_memcpy_#t~loopctr7|))))) (or (not (and (= %2 %1) (= |c_#Ultimate.C_memcpy_src.offset| 0) (= |c_#Ultimate.C_memcpy_dest.offset| 0))) (let ((.cse3 (select |c_#memory_int| %4)) (.cse2 (select |c_#memory_int| %2))) (and (= %7 .cse2) (= %5 .cse3) (= %8 .cse3) (let ((.cse4 (store %3 2 (select %5 2)))) (= (store %0 %1 .cse4) (store |c_#memory_int| %1 .cse4))) (let ((.cse5 (store %7 1 (select %8 1)))) (= (store %6 %1 .cse5) (store |c_#memory_int| %1 .cse5))) (= (select .cse1 2) (select .cse0 2)) (= %3 (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 1 (select .cse1 1))) %1)) (= %3 .cse2) (= %7 (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|))) %2))))))) :qid itp)) :qid itp)) :qid itp)) :qid itp)) :qid itp)) is different from false [2018-04-11 18:38:34,244 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int (Array Int Int)))) (! (forall ((%1 Int) (%2 Int)) (! (exists ((%3 (Array Int Int))) (! (forall ((%4 Int)) (! (exists ((%6 (Array Int (Array Int Int))) (%5 (Array Int Int)) (%8 (Array Int Int)) (%7 (Array Int Int))) (! (let ((.cse0 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|)) (.cse1 (select |c_#memory_int| |c_#Ultimate.C_memcpy_src.base|))) (and (= (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 (+ |c_#Ultimate.C_memcpy_dest.offset| 3) (select .cse1 (+ |c_#Ultimate.C_memcpy_src.offset| 3)))) (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 (+ |c_#Ultimate.C_memcpy_#t~loopctr7| |c_#Ultimate.C_memcpy_dest.offset|) (select .cse1 (+ |c_#Ultimate.C_memcpy_src.offset| |c_#Ultimate.C_memcpy_#t~loopctr7|))))) (or (not (and (= %2 %1) (= |c_#Ultimate.C_memcpy_src.offset| 0) (= |c_#Ultimate.C_memcpy_dest.offset| 0))) (let ((.cse3 (select |c_#memory_int| %4)) (.cse2 (select |c_#memory_int| %2))) (and (= %7 .cse2) (= %5 .cse3) (= %8 .cse3) (let ((.cse4 (store %3 2 (select %5 2)))) (= (store %0 %1 .cse4) (store |c_#memory_int| %1 .cse4))) (let ((.cse5 (store %7 1 (select %8 1)))) (= (store %6 %1 .cse5) (store |c_#memory_int| %1 .cse5))) (= (select .cse1 2) (select .cse0 2)) (= %3 (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 1 (select .cse1 1))) %1)) (= %3 .cse2) (= %7 (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|))) %2))))))) :qid itp)) :qid itp)) :qid itp)) :qid itp)) :qid itp)) is different from true [2018-04-11 18:38:34,245 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,245 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,245 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,246 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,246 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,246 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,246 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,246 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-04-11 18:38:34,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:34,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 126 [2018-04-11 18:38:34,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:34,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 99 [2018-04-11 18:38:34,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:34,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 18:38:34,313 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:187, output treesize:82 [2018-04-11 18:38:34,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,366 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,366 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,366 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-04-11 18:38:34,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:34,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 126 [2018-04-11 18:38:34,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:34,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 99 [2018-04-11 18:38:34,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:34,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 18:38:34,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:187, output treesize:82 [2018-04-11 18:38:34,454 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,454 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,455 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,455 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,455 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,455 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-04-11 18:38:34,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:34,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 18:38:34,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:34,479 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 18:38:34,480 INFO L182 omatonBuilderFactory]: Interpolants [1632#(exists ((%0 (Array Int (Array Int Int)))) (! (forall ((%1 Int) (%2 Int)) (! (exists ((%3 (Array Int Int))) (! (forall ((%4 Int)) (! (exists ((%6 (Array Int (Array Int Int))) (%5 (Array Int Int)) (%8 (Array Int Int)) (%7 (Array Int Int))) (! (and (= (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| 3)))) (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr7|))))) (or (not (and (= %2 %1) (= |#Ultimate.C_memcpy_src.offset| 0) (= |#Ultimate.C_memcpy_dest.offset| 0))) (and (= %7 (select |#memory_int| %2)) (= %5 (select |#memory_int| %4)) (= %8 (select |#memory_int| %4)) (= (store %0 %1 (store %3 2 (select %5 2))) (store |#memory_int| %1 (store %3 2 (select %5 2)))) (= (store %6 %1 (store %7 1 (select %8 1))) (store |#memory_int| %1 (store %7 1 (select %8 1)))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2)) (= %3 (select (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1 (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1))) %1)) (= %3 (select |#memory_int| %2)) (= %7 (select (store |old(#memory_int)| |#Ultimate.C_memcpy_dest.base| (store (select |old(#memory_int)| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_dest.offset| (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_src.offset|))) %2))))) :qid itp)) :qid itp)) :qid itp)) :qid itp)) :qid itp)), 1633#(and (or (forall ((v_prenex_24 Int)) (= (select (store |old(#memory_int)| |#Ultimate.C_memcpy_dest.base| (store (select |old(#memory_int)| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_dest.offset| (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_src.offset|))) v_prenex_24) (select |#memory_int| v_prenex_24))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (forall ((v_prenex_23 Int)) (= (select (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1 (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1))) v_prenex_23) (select |#memory_int| v_prenex_23)))) (or (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))) (or (forall ((v_prenex_22 Int)) (= (select |#memory_int| v_prenex_22) (select (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2 (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2))) v_prenex_22))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))), 1634#(or (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 1) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_src.offset|) 1))), 1612#(= 0 |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset|), 1613#(and (= 0 |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|)), 1614#(and (= 0 |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset|) (= 0 main_~p~0.offset)), 1615#(and (= 0 |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset|) (= 1 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|) 0)) (= 0 main_~p~0.offset)), 1625#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 1626#(and (<= (+ (mod |main_#t~mem2| 256) (* 256 (div |main_#t~mem2| 256))) 1) (<= 1 (+ (mod |main_#t~mem2| 256) (* 256 (div |main_#t~mem2| 256))))), 1627#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base)|)), 1596#true, 1628#(= |#memory_int| |old(#memory_int)|), 1597#false, 1629#(and (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (= |#memory_int| |old(#memory_int)|)), 1630#(and (= 1 |#Ultimate.C_memcpy_#t~loopctr7|) (= (store |old(#memory_int)| |#Ultimate.C_memcpy_dest.base| (store (select |old(#memory_int)| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_dest.offset| (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_src.offset|))) |#memory_int|)), 1631#(exists ((%0 (Array Int (Array Int Int)))) (! (forall ((%1 Int) (%2 Int)) (! (exists ((%3 (Array Int Int))) (! (forall ((%4 Int)) (! (exists ((%5 (Array Int Int))) (! (and (= |#Ultimate.C_memcpy_#t~loopctr7| 2) (or (not (and (= |#Ultimate.C_memcpy_src.offset| 0) (= |#Ultimate.C_memcpy_dest.offset| 0))) (and (= %5 (select |#memory_int| %4)) (= (store %0 %1 (store %3 1 (select %5 1))) (store |#memory_int| %1 (store %3 1 (select %5 1)))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)) (= %3 (select |#memory_int| %2)) (= %3 (select (store |old(#memory_int)| |#Ultimate.C_memcpy_dest.base| (store (select |old(#memory_int)| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_dest.offset| (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_src.offset|))) %2)))) (= (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| 2)))) (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr7|)))))) :qid itp)) :qid itp)) :qid itp)) :qid itp)) :qid itp))] [2018-04-11 18:38:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-04-11 18:38:34,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 18:38:34,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 18:38:34,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=4, NotChecked=26, Total=240 [2018-04-11 18:38:34,481 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 16 states. [2018-04-11 18:38:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:34,884 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-11 18:38:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 18:38:34,884 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 18:38:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:34,885 INFO L225 Difference]: With dead ends: 107 [2018-04-11 18:38:34,885 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 18:38:34,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=462, Unknown=5, NotChecked=44, Total=600 [2018-04-11 18:38:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 18:38:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2018-04-11 18:38:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 18:38:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-04-11 18:38:34,889 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 41 [2018-04-11 18:38:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:34,889 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-04-11 18:38:34,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 18:38:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-04-11 18:38:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 18:38:34,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:34,890 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, 1, 1, 1] [2018-04-11 18:38:34,890 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 18:38:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1486592056, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:34,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:34,906 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:34,907 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,907 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,907 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,907 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:34,910 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 12) (store |c_#length| %1 12)) :qid itp)) :qid itp)) is different from true [2018-04-11 18:38:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:34,967 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: Unsupported proof rule: (let ((a!1 (= (+ |#Ultimate.C_memcpy_dest.offset_-1| (* (- 1) (select |#length_-2| |#Ultimate.C_memcpy_#res.base_-1|))) (+ (* (- 1) (select |#length_-2| |#Ultimate.C_memcpy_#res.base_-1|)) |#Ultimate.C_memcpy_dest.offset_-1|)))) (rewrite a!1)) [2018-04-11 18:38:34,968 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 274 column 204: theory not supported by interpolation or bad proof at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseInterpolants(Executor.java:255) at de.uni_freiburg.informatik.ultimate.smtsolver.external.ScriptorWithGetInterpolants.readInterpolants(ScriptorWithGetInterpolants.java:136) at de.uni_freiburg.informatik.ultimate.smtsolver.external.ScriptorWithGetInterpolants.getInterpolants(ScriptorWithGetInterpolants.java:64) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.getInterpolants(DiffWrapperScript.java:260) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:298) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:351) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-11 18:38:34,970 INFO L168 Benchmark]: Toolchain (without parser) took 16432.04 ms. Allocated memory was 403.2 MB in the beginning and 629.7 MB in the end (delta: 226.5 MB). Free memory was 340.9 MB in the beginning and 429.6 MB in the end (delta: -88.7 MB). Peak memory consumption was 137.8 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:34,971 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 18:38:34,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.39 ms. Allocated memory is still 403.2 MB. Free memory was 340.9 MB in the beginning and 329.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:34,972 INFO L168 Benchmark]: Boogie Preprocessor took 31.57 ms. Allocated memory is still 403.2 MB. Free memory was 329.0 MB in the beginning and 327.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:34,972 INFO L168 Benchmark]: RCFGBuilder took 364.87 ms. Allocated memory was 403.2 MB in the beginning and 568.3 MB in the end (delta: 165.2 MB). Free memory was 327.7 MB in the beginning and 526.1 MB in the end (delta: -198.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:34,973 INFO L168 Benchmark]: TraceAbstraction took 15844.62 ms. Allocated memory was 568.3 MB in the beginning and 629.7 MB in the end (delta: 61.3 MB). Free memory was 526.1 MB in the beginning and 429.6 MB in the end (delta: 96.5 MB). Peak memory consumption was 157.8 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:34,975 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.16 ms. Allocated memory is still 403.2 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.39 ms. Allocated memory is still 403.2 MB. Free memory was 340.9 MB in the beginning and 329.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.57 ms. Allocated memory is still 403.2 MB. Free memory was 329.0 MB in the beginning and 327.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 364.87 ms. Allocated memory was 403.2 MB in the beginning and 568.3 MB in the end (delta: 165.2 MB). Free memory was 327.7 MB in the beginning and 526.1 MB in the end (delta: -198.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15844.62 ms. Allocated memory was 568.3 MB in the beginning and 629.7 MB in the end (delta: 61.3 MB). Free memory was 526.1 MB in the beginning and 429.6 MB in the end (delta: 96.5 MB). Peak memory consumption was 157.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 274 column 204: theory not supported by interpolation or bad proof de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 274 column 204: theory not supported by interpolation or bad proof: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_18-38-34-985.csv Received shutdown request...