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-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 18:38:04,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 18:38:04,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 18:38:04,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 18:38:04,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 18:38:04,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 18:38:04,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 18:38:04,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 18:38:04,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 18:38:04,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 18:38:04,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 18:38:04,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 18:38:04,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 18:38:04,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 18:38:04,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 18:38:04,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 18:38:04,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 18:38:04,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 18:38:04,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 18:38:04,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 18:38:04,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 18:38:04,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 18:38:04,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 18:38:04,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 18:38:04,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 18:38:04,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 18:38:04,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 18:38:04,313 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 18:38:04,314 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 18:38:04,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 18:38:04,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 18:38:04,315 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:04,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 18:38:04,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 18:38:04,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 18:38:04,340 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 18:38:04,340 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 18:38:04,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 18:38:04,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 18:38:04,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 18:38:04,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 18:38:04,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 18:38:04,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 18:38:04,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 18:38:04,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 18:38:04,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-04-11 18:38:04,342 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-04-11 18:38:04,342 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:04,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 18:38:04,381 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 18:38:04,384 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 18:38:04,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 18:38:04,386 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 18:38:04,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 18:38:04,680 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG14ca6fdaf [2018-04-11 18:38:04,775 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 18:38:04,776 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 18:38:04,776 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 18:38:04,777 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 18:38:04,777 INFO L215 ultiparseSymbolTable]: [2018-04-11 18:38:04,777 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 18:38:04,777 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 18:38:04,777 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 18:38:04,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 18:38:04,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 18:38:04,788 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG14ca6fdaf [2018-04-11 18:38:04,791 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 18:38:04,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 18:38:04,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 18:38:04,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 18:38:04,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 18:38:04,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:38:04" (1/1) ... [2018-04-11 18:38:04,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44227733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:04, skipping insertion in model container [2018-04-11 18:38:04,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:38:04" (1/1) ... [2018-04-11 18:38:04,810 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:38:04,822 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:38:04,933 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:38:04,955 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:38:04,959 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 18:38:04,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:04 WrapperNode [2018-04-11 18:38:04,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 18:38:04,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 18:38:04,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 18:38:04,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 18:38:04,975 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:04" (1/1) ... [2018-04-11 18:38:04,975 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:04" (1/1) ... [2018-04-11 18:38:04,984 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:04" (1/1) ... [2018-04-11 18:38:04,984 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:04" (1/1) ... [2018-04-11 18:38:04,991 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:04" (1/1) ... [2018-04-11 18:38:04,996 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:04" (1/1) ... [2018-04-11 18:38:04,997 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:04" (1/1) ... [2018-04-11 18:38:04,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 18:38:05,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 18:38:05,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 18:38:05,000 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 18:38:05,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:04" (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:05,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 18:38:05,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 18:38:05,040 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 18:38:05,040 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 18:38:05,040 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 18:38:05,040 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 18:38:05,040 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 18:38:05,040 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 18:38:05,040 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 18:38:05,041 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 18:38:05,041 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 18:38:05,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 18:38:05,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 18:38:05,041 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 18:38:05,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 18:38:05,041 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 18:38:05,407 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 18:38:05,419 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 18:38:05,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:38:05 BoogieIcfgContainer [2018-04-11 18:38:05,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 18:38:05,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 18:38:05,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 18:38:05,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 18:38:05,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 06:38:04" (1/3) ... [2018-04-11 18:38:05,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f55beb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:38:05, skipping insertion in model container [2018-04-11 18:38:05,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:38:04" (2/3) ... [2018-04-11 18:38:05,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f55beb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:38:05, skipping insertion in model container [2018-04-11 18:38:05,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:38:05" (3/3) ... [2018-04-11 18:38:05,426 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 18:38:05,432 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 18:38:05,438 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-11 18:38:05,461 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 18:38:05,462 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 18:38:05,462 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 18:38:05,462 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-04-11 18:38:05,462 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 18:38:05,462 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 18:38:05,462 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 18:38:05,462 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 18:38:05,462 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 18:38:05,463 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 18:38:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-11 18:38:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 18:38:05,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:05,479 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:05,479 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash -383275974, 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:05,489 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:05,517 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:05,524 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:05,525 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:05,525 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:05,525 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:05,547 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:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:05,599 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:05,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:05,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:38:05,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:05,631 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:05,632 INFO L182 omatonBuilderFactory]: Interpolants [144#(= 1 (select |#valid| |main_#t~malloc0.base|)), 145#(= 1 (select |#valid| main_~p~0.base)), 130#true, 146#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 131#false, 143#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp))] [2018-04-11 18:38:05,632 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:05,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:38:05,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:38:05,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-11 18:38:05,646 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 6 states. [2018-04-11 18:38:05,725 WARN L1011 $PredicateComparison]: unable to prove that (and (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) (= |c_~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |c_old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |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_old(#length)| |c_#length|) (= |c_~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |c_old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)) is different from false [2018-04-11 18:38:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:06,055 INFO L93 Difference]: Finished difference Result 205 states and 225 transitions. [2018-04-11 18:38:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:38:06,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-11 18:38:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:06,070 INFO L225 Difference]: With dead ends: 205 [2018-04-11 18:38:06,070 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 18:38:06,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 18:38:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 123. [2018-04-11 18:38:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 18:38:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-04-11 18:38:06,104 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 17 [2018-04-11 18:38:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:06,105 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-04-11 18:38:06,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:38:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-04-11 18:38:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 18:38:06,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:06,106 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:06,106 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash -383275973, 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:06,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:06,123 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:06,130 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,130 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,130 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,210 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:06,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,212 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:06,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,214 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:06,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,263 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:06,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:8 [2018-04-11 18:38:06,272 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,272 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,273 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,273 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,355 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:06,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,357 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:06,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,360 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:06,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,390 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:06,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:38:06,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:8 [2018-04-11 18:38:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:06,414 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:06,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:06,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 18:38:06,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:06,430 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:06,430 INFO L182 omatonBuilderFactory]: Interpolants [480#false, 492#(= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)), 493#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 479#true] [2018-04-11 18:38:06,430 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:06,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 18:38:06,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 18:38:06,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 18:38:06,432 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 4 states. [2018-04-11 18:38:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:06,600 INFO L93 Difference]: Finished difference Result 191 states and 220 transitions. [2018-04-11 18:38:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 18:38:06,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 18:38:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:06,602 INFO L225 Difference]: With dead ends: 191 [2018-04-11 18:38:06,602 INFO L226 Difference]: Without dead ends: 191 [2018-04-11 18:38:06,603 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:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-11 18:38:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 122. [2018-04-11 18:38:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 18:38:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-04-11 18:38:06,609 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 17 [2018-04-11 18:38:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:06,609 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-04-11 18:38:06,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 18:38:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-04-11 18:38:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 18:38:06,610 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:06,610 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:06,610 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash -383275972, 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:06,612 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:06,622 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:38:06,623 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,623 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,623 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,623 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,664 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#length| %1 10) (store %0 %1 10)) :qid itp)) :qid itp)) is different from true [2018-04-11 18:38:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:06,688 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:06,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:06,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:38:06,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:06,719 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:06,719 INFO L182 omatonBuilderFactory]: Interpolants [822#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#length| %1 10) (store %0 %1 10)) :qid itp)) :qid itp)), 823#(and (= 0 |main_#t~malloc0.offset|) (= 10 (select |#length| |main_#t~malloc0.base|))), 824#(and (<= 0 main_~p~0.offset) (<= (+ main_~p~0.offset 10) (select |#length| main_~p~0.base))), 809#true, 825#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 810#false] [2018-04-11 18:38:06,719 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:06,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:38:06,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:38:06,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-11 18:38:06,719 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 6 states. [2018-04-11 18:38:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:06,897 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2018-04-11 18:38:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 18:38:06,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-11 18:38:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:06,898 INFO L225 Difference]: With dead ends: 114 [2018-04-11 18:38:06,898 INFO L226 Difference]: Without dead ends: 114 [2018-04-11 18:38:06,898 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=27, Unknown=3, NotChecked=10, Total=56 [2018-04-11 18:38:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-11 18:38:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-04-11 18:38:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 18:38:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-04-11 18:38:06,903 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 17 [2018-04-11 18:38:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:06,903 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-04-11 18:38:06,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:38:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-04-11 18:38:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 18:38:06,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:06,904 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:06,904 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash -383275971, 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:06,910 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:06,922 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:06,944 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,944 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,944 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:06,945 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:07,034 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 30 treesize of output 32 [2018-04-11 18:38:07,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,037 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 28 treesize of output 27 [2018-04-11 18:38:07,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,039 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 32 treesize of output 34 [2018-04-11 18:38:07,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,041 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 25 treesize of output 24 [2018-04-11 18:38:07,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,043 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 30 treesize of output 29 [2018-04-11 18:38:07,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,047 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 27 treesize of output 29 [2018-04-11 18:38:07,051 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,093 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 26 treesize of output 28 [2018-04-11 18:38:07,093 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,095 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:07,095 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,112 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:07,112 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,118 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:121, output treesize:12 [2018-04-11 18:38:07,122 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:07,122 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:07,122 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:07,122 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:07,224 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 16 treesize of output 15 [2018-04-11 18:38:07,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,227 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 27 treesize of output 26 [2018-04-11 18:38:07,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,230 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 25 treesize of output 24 [2018-04-11 18:38:07,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,280 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 18 treesize of output 20 [2018-04-11 18:38:07,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:38:07,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:12 [2018-04-11 18:38:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,342 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:07,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:07,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 18:38:07,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:07,361 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:07,361 INFO L182 omatonBuilderFactory]: Interpolants [1056#false, 1068#(and (= 10 (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|)), 1069#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1070#(= |old(#length)| |#length|), 1055#true, 1071#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 0) (= |#length| (store |old(#length)| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| 10)))] [2018-04-11 18:38:07,361 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:07,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:38:07,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:38:07,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 18:38:07,361 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 6 states. [2018-04-11 18:38:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:07,472 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-04-11 18:38:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:38:07,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-11 18:38:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:07,473 INFO L225 Difference]: With dead ends: 113 [2018-04-11 18:38:07,473 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 18:38:07,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:38:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 18:38:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-04-11 18:38:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 18:38:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-04-11 18:38:07,477 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 17 [2018-04-11 18:38:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:07,477 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-04-11 18:38:07,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:38:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-04-11 18:38:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 18:38:07,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:07,478 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] [2018-04-11 18:38:07,478 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:07,478 INFO L82 PathProgramCache]: Analyzing trace with hash 165127000, 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:07,480 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,527 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:07,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:07,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 18:38:07,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:07,546 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:07,546 INFO L182 omatonBuilderFactory]: Interpolants [1312#(= 0 |main_#t~malloc0.offset|), 1313#(= 0 main_~p~0.offset), 1299#true, 1300#false, 1319#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1320#(= |#memory_int| |old(#memory_int)|), 1321#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 1322#(<= |#Ultimate.C_memcpy_size| 0)] [2018-04-11 18:38:07,547 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:07,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:38:07,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:38:07,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:38:07,547 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 8 states. [2018-04-11 18:38:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:07,721 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-04-11 18:38:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:38:07,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-04-11 18:38:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:07,722 INFO L225 Difference]: With dead ends: 102 [2018-04-11 18:38:07,722 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 18:38:07,723 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:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 18:38:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 18:38:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 18:38:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 18:38:07,727 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 26 [2018-04-11 18:38:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:07,728 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 18:38:07,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:38:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 18:38:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 18:38:07,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:07,729 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:07,729 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 730350873, 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:07,732 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,777 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:07,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:07,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 18:38:07,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:07,795 INFO L182 omatonBuilderFactory]: Interpolants [1536#false, 1554#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1555#(= |#memory_int| |old(#memory_int)|), 1556#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 1557#(or (and (< |#Ultimate.C_memcpy_#t~loopctr13| |#Ultimate.C_memcpy_size|) (< 1 |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| 1) (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr13|))), 1558#(<= |#Ultimate.C_memcpy_size| 1), 1535#true] [2018-04-11 18:38:07,795 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:07,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 18:38:07,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 18:38:07,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 18:38:07,796 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-04-11 18:38:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:07,889 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-04-11 18:38:07,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:38:07,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 18:38:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:07,890 INFO L225 Difference]: With dead ends: 103 [2018-04-11 18:38:07,890 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 18:38:07,891 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:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 18:38:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-04-11 18:38:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 18:38:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-04-11 18:38:07,894 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 30 [2018-04-11 18:38:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:07,894 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-04-11 18:38:07,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 18:38:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-04-11 18:38:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 18:38:07,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:07,895 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:07,895 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash 751157291, 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:07,899 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:07,948 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:07,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:07,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 18:38:07,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:07,968 INFO L182 omatonBuilderFactory]: Interpolants [1792#(not (= 10 |#Ultimate.C_memcpy_size|)), 1767#true, 1768#false, 1787#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1788#(= |#memory_int| |old(#memory_int)|), 1789#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 1790#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 1791#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2)] [2018-04-11 18:38:07,968 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:07,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:38:07,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:38:07,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:38:07,968 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 8 states. [2018-04-11 18:38:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:08,083 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-04-11 18:38:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:38:08,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-11 18:38:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:08,084 INFO L225 Difference]: With dead ends: 104 [2018-04-11 18:38:08,084 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 18:38:08,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 18:38:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 18:38:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-11 18:38:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 18:38:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-11 18:38:08,088 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2018-04-11 18:38:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:08,088 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-11 18:38:08,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:38:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-11 18:38:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 18:38:08,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:08,089 INFO L355 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:08,089 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1396156249, 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:08,094 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,138 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:08,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:08,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 18:38:08,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:08,157 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:08,157 INFO L182 omatonBuilderFactory]: Interpolants [2003#true, 2004#false, 2024#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 2025#(= |#memory_int| |old(#memory_int)|), 2026#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 2027#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 2028#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2), 2029#(<= |#Ultimate.C_memcpy_#t~loopctr13| 3), 2030#(not (= 10 |#Ultimate.C_memcpy_size|))] [2018-04-11 18:38:08,157 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:08,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 18:38:08,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 18:38:08,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:38:08,158 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 9 states. [2018-04-11 18:38:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:08,264 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-11 18:38:08,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:38:08,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 18:38:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:08,265 INFO L225 Difference]: With dead ends: 105 [2018-04-11 18:38:08,265 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 18:38:08,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:38:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 18:38:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-11 18:38:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 18:38:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-11 18:38:08,268 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2018-04-11 18:38:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:08,268 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-11 18:38:08,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 18:38:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-11 18:38:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 18:38:08,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:08,269 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:08,269 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash -83712533, 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:08,273 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:08,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:08,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 18:38:08,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:08,348 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:08,348 INFO L182 omatonBuilderFactory]: Interpolants [2272#(not (= 10 |#Ultimate.C_memcpy_size|)), 2243#true, 2244#false, 2265#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 2266#(= |#memory_int| |old(#memory_int)|), 2267#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 2268#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 2269#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2), 2270#(<= |#Ultimate.C_memcpy_#t~loopctr13| 3), 2271#(<= |#Ultimate.C_memcpy_#t~loopctr13| 4)] [2018-04-11 18:38:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:08,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 18:38:08,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 18:38:08,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 18:38:08,349 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 10 states. [2018-04-11 18:38:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:08,471 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-04-11 18:38:08,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 18:38:08,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-04-11 18:38:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:08,472 INFO L225 Difference]: With dead ends: 106 [2018-04-11 18:38:08,472 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 18:38:08,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-04-11 18:38:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 18:38:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 18:38:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 18:38:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-04-11 18:38:08,474 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2018-04-11 18:38:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:08,474 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-04-11 18:38:08,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 18:38:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-04-11 18:38:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 18:38:08,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:08,475 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:08,475 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:08,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1284995481, now seen corresponding path program 5 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:08,479 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:08,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:08,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 18:38:08,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:08,580 INFO L182 omatonBuilderFactory]: Interpolants [2512#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 2513#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 2514#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2), 2515#(<= |#Ultimate.C_memcpy_#t~loopctr13| 3), 2516#(<= |#Ultimate.C_memcpy_#t~loopctr13| 4), 2517#(<= |#Ultimate.C_memcpy_#t~loopctr13| 5), 2518#(not (= 10 |#Ultimate.C_memcpy_size|)), 2487#true, 2488#false, 2510#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 2511#(= |#memory_int| |old(#memory_int)|)] [2018-04-11 18:38:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:08,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 18:38:08,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 18:38:08,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:38:08,580 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 11 states. [2018-04-11 18:38:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:08,750 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-11 18:38:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 18:38:08,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-11 18:38:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:08,751 INFO L225 Difference]: With dead ends: 107 [2018-04-11 18:38:08,751 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 18:38:08,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-04-11 18:38:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 18:38:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-11 18:38:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 18:38:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-11 18:38:08,755 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 34 [2018-04-11 18:38:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:08,755 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-11 18:38:08,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 18:38:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-11 18:38:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 18:38:08,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:08,756 INFO L355 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:08,756 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 765270955, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-04-11 18:38:08,759 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:08,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:08,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 18:38:08,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:08,882 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:08,883 INFO L182 omatonBuilderFactory]: Interpolants [2736#false, 2768#(not (= 10 |#Ultimate.C_memcpy_size|)), 2759#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 2760#(= |#memory_int| |old(#memory_int)|), 2761#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 2762#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 2763#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2), 2764#(<= |#Ultimate.C_memcpy_#t~loopctr13| 3), 2765#(<= |#Ultimate.C_memcpy_#t~loopctr13| 4), 2766#(<= |#Ultimate.C_memcpy_#t~loopctr13| 5), 2735#true, 2767#(<= |#Ultimate.C_memcpy_#t~loopctr13| 6)] [2018-04-11 18:38:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:08,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 18:38:08,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 18:38:08,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-04-11 18:38:08,883 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 12 states. [2018-04-11 18:38:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:09,069 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-11 18:38:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 18:38:09,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-04-11 18:38:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:09,071 INFO L225 Difference]: With dead ends: 108 [2018-04-11 18:38:09,071 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 18:38:09,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-11 18:38:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 18:38:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-04-11 18:38:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 18:38:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-04-11 18:38:09,073 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-04-11 18:38:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:09,074 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-04-11 18:38:09,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 18:38:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-04-11 18:38:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 18:38:09,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:09,078 INFO L355 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:09,078 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679833, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:09,082 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:09,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:09,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 18:38:09,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:09,189 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:09,189 INFO L182 omatonBuilderFactory]: Interpolants [3012#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 3013#(= |#memory_int| |old(#memory_int)|), 3014#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 3015#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 3016#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2), 3017#(<= |#Ultimate.C_memcpy_#t~loopctr13| 3), 3018#(<= |#Ultimate.C_memcpy_#t~loopctr13| 4), 2987#true, 3019#(<= |#Ultimate.C_memcpy_#t~loopctr13| 5), 2988#false, 3020#(<= |#Ultimate.C_memcpy_#t~loopctr13| 6), 3021#(<= |#Ultimate.C_memcpy_#t~loopctr13| 7), 3022#(not (= 10 |#Ultimate.C_memcpy_size|))] [2018-04-11 18:38:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:09,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 18:38:09,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 18:38:09,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-04-11 18:38:09,191 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 13 states. [2018-04-11 18:38:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:09,319 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-04-11 18:38:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 18:38:09,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-04-11 18:38:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:09,320 INFO L225 Difference]: With dead ends: 109 [2018-04-11 18:38:09,320 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 18:38:09,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-04-11 18:38:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 18:38:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-04-11 18:38:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 18:38:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-04-11 18:38:09,322 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2018-04-11 18:38:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:09,322 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-04-11 18:38:09,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 18:38:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-04-11 18:38:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 18:38:09,323 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:09,323 INFO L355 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:09,323 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 594616683, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:09,326 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:09,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:09,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 18:38:09,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:09,435 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:09,435 INFO L182 omatonBuilderFactory]: Interpolants [3269#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 3270#(= |#memory_int| |old(#memory_int)|), 3271#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 3272#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 3273#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2), 3274#(<= |#Ultimate.C_memcpy_#t~loopctr13| 3), 3243#true, 3275#(<= |#Ultimate.C_memcpy_#t~loopctr13| 4), 3244#false, 3276#(<= |#Ultimate.C_memcpy_#t~loopctr13| 5), 3277#(<= |#Ultimate.C_memcpy_#t~loopctr13| 6), 3278#(<= |#Ultimate.C_memcpy_#t~loopctr13| 7), 3279#(<= |#Ultimate.C_memcpy_#t~loopctr13| 8), 3280#(not (= 10 |#Ultimate.C_memcpy_size|))] [2018-04-11 18:38:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:09,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 18:38:09,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 18:38:09,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-11 18:38:09,436 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 14 states. [2018-04-11 18:38:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:09,583 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-04-11 18:38:09,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 18:38:09,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-04-11 18:38:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:09,583 INFO L225 Difference]: With dead ends: 110 [2018-04-11 18:38:09,584 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 18:38:09,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-04-11 18:38:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 18:38:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-11 18:38:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 18:38:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-04-11 18:38:09,587 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2018-04-11 18:38:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:09,587 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-04-11 18:38:09,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 18:38:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-04-11 18:38:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 18:38:09,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:09,587 INFO L355 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:09,587 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash 838364697, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:09,590 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:09,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:09,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 18:38:09,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:09,740 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:09,740 INFO L182 omatonBuilderFactory]: Interpolants [3530#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 3531#(= |#memory_int| |old(#memory_int)|), 3532#(= 0 |#Ultimate.C_memcpy_#t~loopctr13|), 3533#(<= |#Ultimate.C_memcpy_#t~loopctr13| 1), 3534#(<= |#Ultimate.C_memcpy_#t~loopctr13| 2), 3503#true, 3535#(<= |#Ultimate.C_memcpy_#t~loopctr13| 3), 3504#false, 3536#(<= |#Ultimate.C_memcpy_#t~loopctr13| 4), 3537#(<= |#Ultimate.C_memcpy_#t~loopctr13| 5), 3538#(<= |#Ultimate.C_memcpy_#t~loopctr13| 6), 3539#(<= |#Ultimate.C_memcpy_#t~loopctr13| 7), 3540#(<= |#Ultimate.C_memcpy_#t~loopctr13| 8), 3541#(<= |#Ultimate.C_memcpy_#t~loopctr13| 9), 3542#(not (= 10 |#Ultimate.C_memcpy_size|))] [2018-04-11 18:38:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:09,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 18:38:09,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 18:38:09,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-04-11 18:38:09,741 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 15 states. [2018-04-11 18:38:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:09,853 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-04-11 18:38:09,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 18:38:09,853 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-04-11 18:38:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:09,854 INFO L225 Difference]: With dead ends: 111 [2018-04-11 18:38:09,854 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 18:38:09,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-04-11 18:38:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 18:38:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-04-11 18:38:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 18:38:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-04-11 18:38:09,856 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2018-04-11 18:38:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:09,856 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-04-11 18:38:09,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 18:38:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-04-11 18:38:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 18:38:09,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:09,856 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:09,856 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash -195381461, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:09,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,932 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 [2018-04-11 18:38:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:10,277 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 59 DAG size of output 38 [2018-04-11 18:38:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:10,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:38:10,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 18:38:10,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:10,731 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:10,731 INFO L182 omatonBuilderFactory]: Interpolants [3808#(and (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)) (or (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 0) 0) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (< |#Ultimate.C_memcpy_#t~loopctr13| 4) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0))), 3809#(or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (and (< |#Ultimate.C_memcpy_#t~loopctr13| 5) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_#t~loopctr13|) 0)) (and (not (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)))), 3810#(or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (< |#Ultimate.C_memcpy_#t~loopctr13| 6) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)), 3811#(or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (< |#Ultimate.C_memcpy_#t~loopctr13| 8) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)), 3780#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 0))), 3812#(or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (< |#Ultimate.C_memcpy_#t~loopctr13| 9) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)), 3781#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 0))), 3813#(or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (< |#Ultimate.C_memcpy_#t~loopctr13| 10) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)), 3782#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 0)) (= 0 main_~p~0.offset)), 3814#(or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)), 3798#(= 0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 3767#true, 3799#(and (<= 0 (+ (mod |main_#t~mem2| 256) (* 256 (div |main_#t~mem2| 256)))) (<= (+ (mod |main_#t~mem2| 256) (* 256 (div |main_#t~mem2| 256))) 0)), 3768#false, 3800#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 3801#(= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|), 3802#(= |#memory_int| |old(#memory_int)|), 3803#(and (= |#memory_int| |old(#memory_int)|) (= 0 |#Ultimate.C_memcpy_#t~loopctr13|)), 3804#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 0) 0) (= |#Ultimate.C_memcpy_#t~loopctr13| 1) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3805#(and (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 0) 0) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))) (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (and (= (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)))) (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))))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))), 3806#(and (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 0) 0) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))) (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0))), 3807#(and (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)) (or (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 0) 0) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (or (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (< |#Ultimate.C_memcpy_#t~loopctr13| 3) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 0)))] [2018-04-11 18:38:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:10,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 18:38:10,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 18:38:10,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2018-04-11 18:38:10,732 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 22 states. [2018-04-11 18:38:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:11,244 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-04-11 18:38:11,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 18:38:11,245 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2018-04-11 18:38:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:11,245 INFO L225 Difference]: With dead ends: 104 [2018-04-11 18:38:11,245 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 18:38:11,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2018-04-11 18:38:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 18:38:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 18:38:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 18:38:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-04-11 18:38:11,247 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 39 [2018-04-11 18:38:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:11,247 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-04-11 18:38:11,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 18:38:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-04-11 18:38:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 18:38:11,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:38:11,248 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:38:11,248 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 18:38:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -950455689, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:38:11,256 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:38:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:11,326 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 [2018-04-11 18:38:11,336 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:11,336 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:38:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:38:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-04-11 18:38:11,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:38:11,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 18:38:11,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:38:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:38:11,398 INFO L182 omatonBuilderFactory]: Interpolants [4056#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (= 3 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 1))), 4057#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|) (= 3 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 1)) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 4073#(= 3 (select (select |#memory_int| main_~p~0.base) (+ 1 main_~p~0.offset))), 4074#(and (<= (+ (* 256 (div |main_#t~mem3| 256)) (mod |main_#t~mem3| 256)) 3) (<= 3 (+ (* 256 (div |main_#t~mem3| 256)) (mod |main_#t~mem3| 256)))), 4043#true, 4075#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 4044#false, 4076#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 4077#(= |#memory_int| |old(#memory_int)|)] [2018-04-11 18:38:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-04-11 18:38:11,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 18:38:11,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 18:38:11,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:38:11,399 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 9 states. [2018-04-11 18:38:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:38:11,454 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2018-04-11 18:38:11,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:38:11,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-04-11 18:38:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:38:11,454 INFO L225 Difference]: With dead ends: 16 [2018-04-11 18:38:11,454 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 18:38:11,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-04-11 18:38:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 18:38:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 18:38:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 18:38:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 18:38:11,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-04-11 18:38:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:38:11,455 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 18:38:11,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 18:38:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 18:38:11,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 18:38:11,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 06:38:11 BoogieIcfgContainer [2018-04-11 18:38:11,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 18:38:11,458 INFO L168 Benchmark]: Toolchain (without parser) took 6667.03 ms. Allocated memory was 403.2 MB in the beginning and 677.4 MB in the end (delta: 274.2 MB). Free memory was 339.6 MB in the beginning and 595.5 MB in the end (delta: -255.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:11,459 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 403.2 MB. Free memory is still 360.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 18:38:11,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.63 ms. Allocated memory is still 403.2 MB. Free memory was 338.3 MB in the beginning and 327.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:11,459 INFO L168 Benchmark]: Boogie Preprocessor took 32.40 ms. Allocated memory is still 403.2 MB. Free memory was 327.7 MB in the beginning and 325.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:11,460 INFO L168 Benchmark]: RCFGBuilder took 420.52 ms. Allocated memory was 403.2 MB in the beginning and 590.3 MB in the end (delta: 187.2 MB). Free memory was 325.1 MB in the beginning and 542.9 MB in the end (delta: -217.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:11,460 INFO L168 Benchmark]: TraceAbstraction took 6036.91 ms. Allocated memory was 590.3 MB in the beginning and 677.4 MB in the end (delta: 87.0 MB). Free memory was 542.9 MB in the beginning and 595.5 MB in the end (delta: -52.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. [2018-04-11 18:38:11,461 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.18 ms. Allocated memory is still 403.2 MB. Free memory is still 360.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 174.63 ms. Allocated memory is still 403.2 MB. Free memory was 338.3 MB in the beginning and 327.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.40 ms. Allocated memory is still 403.2 MB. Free memory was 327.7 MB in the beginning and 325.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 420.52 ms. Allocated memory was 403.2 MB in the beginning and 590.3 MB in the end (delta: 187.2 MB). Free memory was 325.1 MB in the beginning and 542.9 MB in the end (delta: -217.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6036.91 ms. Allocated memory was 590.3 MB in the beginning and 677.4 MB in the end (delta: 87.0 MB). Free memory was 542.9 MB in the beginning and 595.5 MB in the end (delta: -52.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 66]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 60]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 49]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 63]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 46]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 54]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 69]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 60]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 64]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 51]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 63]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 61]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 51]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 67]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 70]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 46]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 72]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 55]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 64]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 54]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 61]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 70]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 72]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 49]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 67]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 58]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 66]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 69]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 47 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 127 locations, 47 error locations. SAFE Result, 6.0s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1208 SDtfs, 1126 SDslu, 7039 SDs, 0 SdLazy, 3433 SolverSat, 201 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 64 SyntacticMatches, 21 SemanticMatches, 171 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 55/275 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 154 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 464 ConstructedInterpolants, 4 QuantifiedInterpolants, 72800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 55/275 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_18-38-11-467.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_18-38-11-467.csv Received shutdown request...