./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c 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/ArraysOfVariableLength.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 a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:10:05,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:10:05,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:10:05,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:10:05,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:10:05,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:10:05,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:10:05,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:10:05,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:10:05,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:10:05,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:10:05,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:10:05,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:10:05,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:10:05,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:10:05,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:10:05,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:10:05,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:10:05,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:10:05,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:10:05,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:10:05,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:10:05,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:10:05,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:10:05,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:10:05,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:10:05,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:10:05,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:10:05,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:10:05,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:10:05,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:10:05,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:10:05,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:10:05,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:10:05,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:10:05,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:10:05,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:10:05,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:10:05,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:10:05,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:10:05,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:10:05,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:10:05,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:10:05,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:10:05,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:10:05,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:10:05,781 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:10:05,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:10:05,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:10:05,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:10:05,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:10:05,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:10:05,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:10:05,783 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:10:05,784 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:10:05,784 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:10:05,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:10:05,785 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:10:05,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:10:05,785 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:10:05,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:10:05,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:10:05,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:10:05,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:10:05,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:10:05,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:10:05,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:10:05,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:10:05,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:10:05,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:10:05,788 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 -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2019-11-28 20:10:06,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:10:06,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:10:06,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:10:06,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:10:06,158 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:10:06,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2019-11-28 20:10:06,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779ebb8d4/2bfdd605e5bd4d97831fccf1818331f4/FLAG3f21ecafe [2019-11-28 20:10:06,704 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:10:06,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2019-11-28 20:10:06,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779ebb8d4/2bfdd605e5bd4d97831fccf1818331f4/FLAG3f21ecafe [2019-11-28 20:10:07,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779ebb8d4/2bfdd605e5bd4d97831fccf1818331f4 [2019-11-28 20:10:07,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:10:07,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:10:07,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:07,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:10:07,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:10:07,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1cb90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07, skipping insertion in model container [2019-11-28 20:10:07,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:10:07,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:10:07,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:07,378 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:10:07,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:07,469 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:10:07,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07 WrapperNode [2019-11-28 20:10:07,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:07,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:10:07,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:10:07,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:10:07,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (1/1) ... [2019-11-28 20:10:07,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:10:07,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:10:07,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:10:07,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:10:07,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (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 20:10:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:10:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:10:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 20:10:07,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:10:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 20:10:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:10:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:10:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:10:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:10:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:10:07,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:10:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:10:07,899 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:10:07,899 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 20:10:07,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:07 BoogieIcfgContainer [2019-11-28 20:10:07,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:10:07,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:10:07,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:10:07,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:10:07,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:10:07" (1/3) ... [2019-11-28 20:10:07,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c9b484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:07, skipping insertion in model container [2019-11-28 20:10:07,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:07" (2/3) ... [2019-11-28 20:10:07,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c9b484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:07, skipping insertion in model container [2019-11-28 20:10:07,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:07" (3/3) ... [2019-11-28 20:10:07,919 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength.c [2019-11-28 20:10:07,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:10:07,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:10:07,951 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:10:07,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:10:07,970 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:10:07,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:10:07,970 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:10:07,970 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:10:07,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:10:07,971 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:10:07,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:10:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 20:10:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:10:07,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:07,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:07,997 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 20:10:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 20:10:08,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:08,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398323170] [2019-11-28 20:10:08,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:08,207 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 20:10:08,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398323170] [2019-11-28 20:10:08,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:08,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:10:08,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362083405] [2019-11-28 20:10:08,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:08,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:08,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:08,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:08,235 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 20:10:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:08,416 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 20:10:08,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:08,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:10:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:08,432 INFO L225 Difference]: With dead ends: 58 [2019-11-28 20:10:08,433 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:10:08,437 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 20:10:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:10:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 20:10:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:10:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 20:10:08,495 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 20:10:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:08,497 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:10:08,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 20:10:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:10:08,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:08,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:08,500 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 20:10:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 20:10:08,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:08,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775935675] [2019-11-28 20:10:08,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:08,622 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 20:10:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775935675] [2019-11-28 20:10:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:10:08,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195174326] [2019-11-28 20:10:08,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:08,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:08,627 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-28 20:10:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:08,852 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-28 20:10:08,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:08,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-28 20:10:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:08,855 INFO L225 Difference]: With dead ends: 59 [2019-11-28 20:10:08,855 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:10:08,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:10:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-11-28 20:10:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:10:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 20:10:08,870 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-11-28 20:10:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:08,871 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 20:10:08,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 20:10:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:10:08,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:08,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:08,874 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 20:10:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:08,874 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 20:10:08,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:08,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959471718] [2019-11-28 20:10:08,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:08,988 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 20:10:08,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959471718] [2019-11-28 20:10:08,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:08,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:08,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877442018] [2019-11-28 20:10:08,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:08,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:08,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:08,991 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-11-28 20:10:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:09,070 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-28 20:10:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:09,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 20:10:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:09,074 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:10:09,074 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:10:09,075 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 20:10:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:10:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:10:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:10:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-28 20:10:09,082 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-11-28 20:10:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:09,083 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-28 20:10:09,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-28 20:10:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:10:09,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:09,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:09,085 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 20:10:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-11-28 20:10:09,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:09,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176755858] [2019-11-28 20:10:09,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,157 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 20:10:09,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176755858] [2019-11-28 20:10:09,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:09,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:09,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160798757] [2019-11-28 20:10:09,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:09,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:09,160 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2019-11-28 20:10:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:09,258 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 20:10:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:09,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 20:10:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:09,259 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:10:09,260 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:10:09,260 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 20:10:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:10:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 20:10:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:10:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 20:10:09,266 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-11-28 20:10:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:09,267 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 20:10:09,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 20:10:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:10:09,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:09,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:09,269 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 20:10:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-11-28 20:10:09,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:09,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825935318] [2019-11-28 20:10:09,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:09,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825935318] [2019-11-28 20:10:09,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093079813] [2019-11-28 20:10:09,359 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 20:10:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:10:09,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:09,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:09,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 20:10:09,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022374758] [2019-11-28 20:10:09,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:09,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:09,483 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2019-11-28 20:10:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:09,621 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 20:10:09,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:09,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 20:10:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:09,623 INFO L225 Difference]: With dead ends: 69 [2019-11-28 20:10:09,624 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 20:10:09,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 20:10:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-11-28 20:10:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:10:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 20:10:09,632 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-11-28 20:10:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:09,633 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 20:10:09,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-28 20:10:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:10:09,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:09,635 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:09,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:09,839 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 20:10:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-11-28 20:10:09,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:09,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439536857] [2019-11-28 20:10:09,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:10:09,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439536857] [2019-11-28 20:10:09,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:09,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:10:09,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495246381] [2019-11-28 20:10:09,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:09,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:09,940 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2019-11-28 20:10:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:10,102 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-28 20:10:10,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:10,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 20:10:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:10,104 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:10:10,104 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 20:10:10,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:10:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 20:10:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-11-28 20:10:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:10:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-11-28 20:10:10,111 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-11-28 20:10:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:10,111 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-28 20:10:10,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-11-28 20:10:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:10:10,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:10,113 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:10,113 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 20:10:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-11-28 20:10:10,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:10,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151842861] [2019-11-28 20:10:10,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:10,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151842861] [2019-11-28 20:10:10,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:10,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:10:10,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862422378] [2019-11-28 20:10:10,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:10,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:10,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:10,213 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2019-11-28 20:10:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:10,342 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-11-28 20:10:10,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:10,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-28 20:10:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:10,344 INFO L225 Difference]: With dead ends: 53 [2019-11-28 20:10:10,345 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:10:10,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:10:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 20:10:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:10:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-28 20:10:10,354 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-11-28 20:10:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:10,355 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-28 20:10:10,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-28 20:10:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:10:10,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:10,356 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:10,356 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 20:10:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-11-28 20:10:10,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:10,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106879973] [2019-11-28 20:10:10,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:10,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106879973] [2019-11-28 20:10:10,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:10,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:10:10,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562084564] [2019-11-28 20:10:10,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:10:10,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:10:10,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:10,559 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 10 states. [2019-11-28 20:10:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:10,889 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-28 20:10:10,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:10:10,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 20:10:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:10,891 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:10:10,891 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:10:10,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:10:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:10:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-28 20:10:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:10:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-28 20:10:10,898 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-11-28 20:10:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:10,898 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-28 20:10:10,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:10:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-28 20:10:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:10:10,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:10,899 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:10,900 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 20:10:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-11-28 20:10:10,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:10,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896183914] [2019-11-28 20:10:10,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:10:11,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896183914] [2019-11-28 20:10:11,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:11,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:10:11,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434706903] [2019-11-28 20:10:11,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:10:11,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:11,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:10:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:11,045 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 7 states. [2019-11-28 20:10:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:11,179 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-28 20:10:11,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:11,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 20:10:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:11,181 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:10:11,182 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 20:10:11,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 20:10:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-11-28 20:10:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 20:10:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-11-28 20:10:11,187 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2019-11-28 20:10:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:11,188 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-11-28 20:10:11,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:10:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-11-28 20:10:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:10:11,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:11,189 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:11,189 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 20:10:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-11-28 20:10:11,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:11,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788658496] [2019-11-28 20:10:11,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:11,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788658496] [2019-11-28 20:10:11,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045972024] [2019-11-28 20:10:11,307 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 20:10:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:10:11,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:11,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:11,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-28 20:10:11,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366092734] [2019-11-28 20:10:11,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:10:11,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:11,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:10:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:11,405 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 12 states. [2019-11-28 20:10:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:11,629 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-28 20:10:11,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:10:11,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 20:10:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:11,631 INFO L225 Difference]: With dead ends: 78 [2019-11-28 20:10:11,631 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 20:10:11,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:10:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 20:10:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2019-11-28 20:10:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:10:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-28 20:10:11,637 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2019-11-28 20:10:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:11,637 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-28 20:10:11,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:10:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-28 20:10:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:10:11,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:11,639 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:11,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:11,840 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 20:10:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1979886526, now seen corresponding path program 2 times [2019-11-28 20:10:11,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:11,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062169853] [2019-11-28 20:10:11,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:10:11,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062169853] [2019-11-28 20:10:11,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659202459] [2019-11-28 20:10:11,925 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 20:10:11,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:11,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:11,961 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:10:11,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:12,020 INFO L377 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 6 treesize of output 5 [2019-11-28 20:10:12,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:12,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:12,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:10:12,026 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:10:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:10:12,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:12,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-28 20:10:12,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518779303] [2019-11-28 20:10:12,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:12,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:12,143 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2019-11-28 20:10:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:12,175 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-28 20:10:12,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:12,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 20:10:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:12,176 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:10:12,176 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 20:10:12,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 20:10:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-28 20:10:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:10:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-11-28 20:10:12,183 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 32 [2019-11-28 20:10:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:12,183 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-11-28 20:10:12,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-11-28 20:10:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 20:10:12,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:12,185 INFO L410 BasicCegarLoop]: trace histogram [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 20:10:12,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:12,390 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash -13619034, now seen corresponding path program 1 times [2019-11-28 20:10:12,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645631948] [2019-11-28 20:10:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:10:12,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645631948] [2019-11-28 20:10:12,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587923254] [2019-11-28 20:10:12,454 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 20:10:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:10:12,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:12,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:12,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-11-28 20:10:12,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026530117] [2019-11-28 20:10:12,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:12,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:12,578 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2019-11-28 20:10:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:12,685 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-11-28 20:10:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:12,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-28 20:10:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:12,686 INFO L225 Difference]: With dead ends: 73 [2019-11-28 20:10:12,687 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:10:12,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:10:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-28 20:10:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:10:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-28 20:10:12,693 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 35 [2019-11-28 20:10:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:12,694 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-28 20:10:12,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-28 20:10:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 20:10:12,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:12,695 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:12,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:12,899 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -548707221, now seen corresponding path program 1 times [2019-11-28 20:10:12,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:12,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109195205] [2019-11-28 20:10:12,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 20:10:12,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109195205] [2019-11-28 20:10:12,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410588916] [2019-11-28 20:10:12,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 20:10:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:13,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:10:13,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 20:10:13,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:13,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 20:10:13,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928268817] [2019-11-28 20:10:13,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:10:13,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:10:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:13,092 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 7 states. [2019-11-28 20:10:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:13,222 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-28 20:10:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:13,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-28 20:10:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:13,224 INFO L225 Difference]: With dead ends: 87 [2019-11-28 20:10:13,224 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 20:10:13,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 20:10:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-11-28 20:10:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 20:10:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-11-28 20:10:13,236 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2019-11-28 20:10:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:13,236 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-11-28 20:10:13,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:10:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-11-28 20:10:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:10:13,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:13,241 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:13,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:13,446 INFO L410 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:13,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2019-11-28 20:10:13,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:13,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421110037] [2019-11-28 20:10:13,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 20:10:13,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421110037] [2019-11-28 20:10:13,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637273487] [2019-11-28 20:10:13,544 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:13,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:10:13,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:13,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:13,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 20:10:13,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:13,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-11-28 20:10:13,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466098897] [2019-11-28 20:10:13,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:10:13,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:13,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:10:13,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:13,598 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 8 states. [2019-11-28 20:10:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:13,740 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-28 20:10:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:10:13,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-11-28 20:10:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:13,742 INFO L225 Difference]: With dead ends: 72 [2019-11-28 20:10:13,743 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 20:10:13,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 20:10:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-11-28 20:10:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:10:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-11-28 20:10:13,746 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 43 [2019-11-28 20:10:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:13,747 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-11-28 20:10:13,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:10:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-11-28 20:10:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 20:10:13,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:13,748 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:13,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:13,956 INFO L410 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1444841842, now seen corresponding path program 2 times [2019-11-28 20:10:13,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:13,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922343048] [2019-11-28 20:10:13,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:10:14,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922343048] [2019-11-28 20:10:14,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160617487] [2019-11-28 20:10:14,030 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:14,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:14,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:14,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:10:14,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:14,102 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-28 20:10:14,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:14,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:14,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:14,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 20:10:14,150 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-28 20:10:14,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:14,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:14,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:14,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 20:10:14,200 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-28 20:10:14,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:14,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:14,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:14,205 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 20:10:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-28 20:10:14,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:14,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2019-11-28 20:10:14,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992104742] [2019-11-28 20:10:14,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:14,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:14,272 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2019-11-28 20:10:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:14,342 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-11-28 20:10:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:14,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-28 20:10:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:14,343 INFO L225 Difference]: With dead ends: 67 [2019-11-28 20:10:14,343 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:10:14,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:10:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:10:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:10:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:10:14,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-28 20:10:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:14,344 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:10:14,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:10:14,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:10:14,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:14,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:10:14 BoogieIcfgContainer [2019-11-28 20:10:14,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:10:14,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:10:14,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:10:14,552 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:10:14,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:07" (3/4) ... [2019-11-28 20:10:14,556 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:10:14,561 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:10:14,562 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 20:10:14,562 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:10:14,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 20:10:14,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 20:10:14,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:10:14,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:10:14,616 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:10:14,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:10:14,618 INFO L168 Benchmark]: Toolchain (without parser) took 7504.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 961.7 MB in the beginning and 854.5 MB in the end (delta: 107.2 MB). Peak memory consumption was 299.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:14,618 INFO L168 Benchmark]: CDTParser took 0.33 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 20:10:14,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:14,619 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:14,620 INFO L168 Benchmark]: RCFGBuilder took 392.10 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:14,621 INFO L168 Benchmark]: TraceAbstraction took 6648.12 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 862.3 MB in the end (delta: 225.4 MB). Peak memory consumption was 298.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:14,622 INFO L168 Benchmark]: Witness Printer took 64.07 ms. Allocated memory is still 1.2 GB. Free memory was 862.3 MB in the beginning and 854.5 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:14,631 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.33 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 356.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.14 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.10 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6648.12 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 862.3 MB in the end (delta: 225.4 MB). Peak memory consumption was 298.8 MB. Max. memory is 11.5 GB. * Witness Printer took 64.07 ms. Allocated memory is still 1.2 GB. Free memory was 862.3 MB in the beginning and 854.5 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: 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: 6.5s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 353 SDtfs, 602 SDslu, 559 SDs, 0 SdLazy, 1287 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 306 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 103 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 653 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 631 ConstructedInterpolants, 36 QuantifiedInterpolants, 74548 SizeOfPredicates, 11 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 22 InterpolantComputations, 11 PerfectInterpolantSequences, 215/277 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...