./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07b05923cf5c1b39a35ab81b524575a0a488c268 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:37:36,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:37:36,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:37:36,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:37:36,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:37:36,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:37:36,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:37:36,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:37:36,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:37:36,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:37:36,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:37:36,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:37:36,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:37:36,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:37:36,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:37:36,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:37:36,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:37:36,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:37:36,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:37:36,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:37:36,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:37:36,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:37:36,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:37:36,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:37:36,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:37:36,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:37:36,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:37:36,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:37:36,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:37:36,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:37:36,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:37:36,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:37:36,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:37:36,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:37:36,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:37:36,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:37:36,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:37:36,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:37:36,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:37:36,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:37:36,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:37:36,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:37:36,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:37:36,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:37:36,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:37:36,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:37:36,650 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:37:36,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:37:36,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:37:36,651 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:37:36,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:37:36,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:37:36,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:37:36,652 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:37:36,652 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:37:36,652 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:37:36,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:37:36,653 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:37:36,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:37:36,653 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:37:36,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:37:36,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:37:36,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:37:36,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:37:36,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:36,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:37:36,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:37:36,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:37:36,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:37:36,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07b05923cf5c1b39a35ab81b524575a0a488c268 [2019-11-28 02:37:37,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:37:37,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:37:37,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:37:37,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:37:37,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:37:37,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2019-11-28 02:37:37,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e778f86/32efa7fbb4dc417195f66d69b938d220/FLAGa06da18bb [2019-11-28 02:37:37,565 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:37:37,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2019-11-28 02:37:37,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e778f86/32efa7fbb4dc417195f66d69b938d220/FLAGa06da18bb [2019-11-28 02:37:37,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e778f86/32efa7fbb4dc417195f66d69b938d220 [2019-11-28 02:37:37,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:37:37,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:37:37,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:37,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:37:37,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:37:37,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b54b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37, skipping insertion in model container [2019-11-28 02:37:37,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:37:37,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:37:38,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:38,177 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:37:38,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:38,207 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:37:38,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38 WrapperNode [2019-11-28 02:37:38,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:38,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:37:38,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:37:38,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:37:38,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:37:38,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:37:38,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:37:38,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:37:38,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... No working directory specified, using /storage/repos/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 [2019-11-28 02:37:38,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:37:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:37:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 02:37:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:37:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 02:37:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:37:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:37:38,717 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:37:38,717 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 02:37:38,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:38 BoogieIcfgContainer [2019-11-28 02:37:38,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:37:38,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:37:38,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:37:38,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:37:38,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:37:37" (1/3) ... [2019-11-28 02:37:38,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c74514f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:38, skipping insertion in model container [2019-11-28 02:37:38,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (2/3) ... [2019-11-28 02:37:38,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c74514f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:38, skipping insertion in model container [2019-11-28 02:37:38,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:38" (3/3) ... [2019-11-28 02:37:38,726 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6.c [2019-11-28 02:37:38,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:37:38,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:37:38,751 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:37:38,771 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:37:38,771 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:37:38,771 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:37:38,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:37:38,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:37:38,772 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:37:38,772 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:37:38,772 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:37:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 02:37:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:37:38,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:38,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:38,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:38,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:38,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 02:37:38,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:38,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440016646] [2019-11-28 02:37:38,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:38,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440016646] [2019-11-28 02:37:39,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:37:39,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557991751] [2019-11-28 02:37:39,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:39,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:39,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:39,024 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 02:37:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,216 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 02:37:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:39,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:37:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,228 INFO L225 Difference]: With dead ends: 58 [2019-11-28 02:37:39,229 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:39,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 02:37:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 02:37:39,285 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 02:37:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,286 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 02:37:39,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 02:37:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:37:39,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,288 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 02:37:39,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136362798] [2019-11-28 02:37:39,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136362798] [2019-11-28 02:37:39,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:39,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325343836] [2019-11-28 02:37:39,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:39,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:39,360 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-28 02:37:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,471 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 02:37:39,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:39,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:37:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,475 INFO L225 Difference]: With dead ends: 49 [2019-11-28 02:37:39,475 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 02:37:39,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 02:37:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-28 02:37:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:37:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 02:37:39,483 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-11-28 02:37:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,483 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 02:37:39,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 02:37:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:39,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-11-28 02:37:39,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470021253] [2019-11-28 02:37:39,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470021253] [2019-11-28 02:37:39,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:37:39,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524179134] [2019-11-28 02:37:39,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:37:39,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:37:39,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:39,583 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2019-11-28 02:37:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,836 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-28 02:37:39,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:39,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 02:37:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,838 INFO L225 Difference]: With dead ends: 40 [2019-11-28 02:37:39,838 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:37:39,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:37:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 02:37:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:37:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-28 02:37:39,848 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-11-28 02:37:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,849 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-28 02:37:39,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:37:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-28 02:37:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:39,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-11-28 02:37:39,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497020694] [2019-11-28 02:37:39,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497020694] [2019-11-28 02:37:40,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:40,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:37:40,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754994303] [2019-11-28 02:37:40,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:37:40,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:37:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:40,030 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2019-11-28 02:37:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:40,271 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-28 02:37:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:37:40,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-28 02:37:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:40,273 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:37:40,273 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:37:40,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:37:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 02:37:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 02:37:40,280 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-11-28 02:37:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:40,280 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 02:37:40,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:37:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 02:37:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:37:40,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:40,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:40,282 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 02:37:40,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:40,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324199039] [2019-11-28 02:37:40,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324199039] [2019-11-28 02:37:40,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:40,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:37:40,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660362673] [2019-11-28 02:37:40,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:37:40,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:37:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:40,399 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-28 02:37:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:40,542 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-11-28 02:37:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:40,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-28 02:37:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:40,544 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:37:40,544 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:37:40,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:37:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 02:37:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 02:37:40,554 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2019-11-28 02:37:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:40,556 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 02:37:40,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:37:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 02:37:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:37:40,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:40,557 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:40,557 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:40,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-11-28 02:37:40,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:40,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134345806] [2019-11-28 02:37:40,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134345806] [2019-11-28 02:37:40,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798401983] [2019-11-28 02:37:40,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:37:40,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:40,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-11-28 02:37:40,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673350737] [2019-11-28 02:37:40,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:37:40,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:37:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:40,802 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2019-11-28 02:37:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:41,066 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 02:37:41,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:37:41,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-28 02:37:41,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:41,068 INFO L225 Difference]: With dead ends: 47 [2019-11-28 02:37:41,068 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 02:37:41,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:37:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 02:37:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 02:37:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 02:37:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-28 02:37:41,074 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2019-11-28 02:37:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:41,075 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-28 02:37:41,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:37:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-28 02:37:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:37:41,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:41,077 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:41,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,279 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2019-11-28 02:37:41,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:41,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355448299] [2019-11-28 02:37:41,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 02:37:41,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355448299] [2019-11-28 02:37:41,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:41,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:41,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129747087] [2019-11-28 02:37:41,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:41,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:41,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:41,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:41,382 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2019-11-28 02:37:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:41,442 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-11-28 02:37:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:41,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 02:37:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:41,444 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:37:41,444 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 02:37:41,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 02:37:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 02:37:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:37:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 02:37:41,449 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 30 [2019-11-28 02:37:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:41,449 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 02:37:41,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 02:37:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:37:41,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:41,451 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:41,451 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash -661735506, now seen corresponding path program 1 times [2019-11-28 02:37:41,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:41,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53722939] [2019-11-28 02:37:41,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:41,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53722939] [2019-11-28 02:37:41,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760151602] [2019-11-28 02:37:41,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:37:41,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:41,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:41,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 02:37:41,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650630809] [2019-11-28 02:37:41,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:37:41,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:37:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:37:41,844 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 13 states. [2019-11-28 02:37:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:42,190 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 02:37:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:37:42,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-28 02:37:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:42,192 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:37:42,192 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:42,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:37:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-11-28 02:37:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:37:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-28 02:37:42,197 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 30 [2019-11-28 02:37:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:42,198 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-28 02:37:42,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:37:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-28 02:37:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:37:42,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:42,199 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:42,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723375, now seen corresponding path program 2 times [2019-11-28 02:37:42,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:42,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449074508] [2019-11-28 02:37:42,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:42,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449074508] [2019-11-28 02:37:42,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727331314] [2019-11-28 02:37:42,684 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:42,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:42,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:42,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:42,754 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_24|]} [2019-11-28 02:37:42,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:42,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 02:37:42,776 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:42,788 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:42,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:42,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 02:37:42,795 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:42,803 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:42,804 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:42,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 02:37:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 02:37:42,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:42,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-28 02:37:42,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310799438] [2019-11-28 02:37:42,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:37:42,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:42,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:37:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:42,974 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2019-11-28 02:37:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:43,026 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-28 02:37:43,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:43,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 02:37:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:43,031 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:37:43,031 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:37:43,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:37:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 02:37:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:37:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-28 02:37:43,041 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 35 [2019-11-28 02:37:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:43,042 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-28 02:37:43,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:37:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-28 02:37:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 02:37:43,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:43,046 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-11-28 02:37:43,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,250 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1738652280, now seen corresponding path program 1 times [2019-11-28 02:37:43,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:43,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146145838] [2019-11-28 02:37:43,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 02:37:43,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146145838] [2019-11-28 02:37:43,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005210428] [2019-11-28 02:37:43,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:43,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:43,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:43,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-11-28 02:37:43,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087964894] [2019-11-28 02:37:43,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:37:43,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:43,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:37:43,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:43,461 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 11 states. [2019-11-28 02:37:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:43,741 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-11-28 02:37:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:37:43,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-11-28 02:37:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:43,743 INFO L225 Difference]: With dead ends: 84 [2019-11-28 02:37:43,743 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 02:37:43,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:37:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 02:37:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2019-11-28 02:37:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 02:37:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-28 02:37:43,750 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 44 [2019-11-28 02:37:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:43,750 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-28 02:37:43,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:37:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-28 02:37:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 02:37:43,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:43,754 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:43,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,958 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash -950238676, now seen corresponding path program 2 times [2019-11-28 02:37:43,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:43,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060796216] [2019-11-28 02:37:43,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-28 02:37:44,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060796216] [2019-11-28 02:37:44,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309756835] [2019-11-28 02:37:44,064 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:44,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:44,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:44,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:44,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:44,162 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:44,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 02:37:44,163 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:44,169 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:44,170 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:44,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:44,253 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:44,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 02:37:44,254 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:44,260 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:44,261 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:44,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-11-28 02:37:44,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:44,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-28 02:37:44,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672525755] [2019-11-28 02:37:44,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:44,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:44,377 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 6 states. [2019-11-28 02:37:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:44,489 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-28 02:37:44,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:44,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-28 02:37:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:44,490 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:37:44,490 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:37:44,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:37:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:37:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:37:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:37:44,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2019-11-28 02:37:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:44,495 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:37:44,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:37:44,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:37:44,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:44,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:37:44 BoogieIcfgContainer [2019-11-28 02:37:44,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:37:44,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:37:44,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:37:44,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:37:44,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:38" (3/4) ... [2019-11-28 02:37:44,707 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:37:44,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:37:44,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 02:37:44,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:37:44,719 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-28 02:37:44,719 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 02:37:44,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:37:44,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:37:44,766 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:37:44,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:37:44,768 INFO L168 Benchmark]: Toolchain (without parser) took 6818.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 961.7 MB in the beginning and 855.6 MB in the end (delta: 106.1 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:44,768 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:44,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.08 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:44,770 INFO L168 Benchmark]: Boogie Preprocessor took 105.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:44,770 INFO L168 Benchmark]: RCFGBuilder took 405.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:44,771 INFO L168 Benchmark]: TraceAbstraction took 5982.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 212.6 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:44,772 INFO L168 Benchmark]: Witness Printer took 62.94 ms. Allocated memory is still 1.2 GB. Free memory was 863.4 MB in the beginning and 855.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:44,775 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.08 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 405.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5982.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 212.6 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB. * Witness Printer took 62.94 ms. Allocated memory is still 1.2 GB. Free memory was 863.4 MB in the beginning and 855.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Result: SAFE, OverallTime: 5.9s, OverallIterations: 11, TraceHistogramMax: 10, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 277 SDtfs, 501 SDslu, 675 SDs, 0 SdLazy, 860 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 510 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 494 ConstructedInterpolants, 90 QuantifiedInterpolants, 182724 SizeOfPredicates, 5 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 596/712 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...