./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.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/ArraysOfVariableLength5.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 32d9f155778c5c4efaa55d37fdad329bb0d271b5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:16,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:10:16,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:10:16,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:10:16,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:10:16,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:10:16,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:10:16,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:10:16,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:10:16,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:10:16,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:10:16,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:10:16,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:10:16,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:10:16,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:10:16,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:10:16,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:10:16,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:10:16,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:10:16,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:10:16,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:10:16,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:10:16,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:10:16,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:10:16,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:10:16,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:10:16,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:10:16,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:10:16,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:10:16,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:10:16,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:10:16,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:10:16,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:10:16,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:10:16,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:10:16,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:10:16,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:10:16,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:10:16,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:10:16,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:10:16,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:10:16,623 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:16,641 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:10:16,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:10:16,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:10:16,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:10:16,644 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:10:16,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:10:16,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:10:16,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:10:16,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:10:16,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:10:16,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:10:16,646 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:10:16,646 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:10:16,646 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:10:16,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:10:16,647 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:10:16,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:10:16,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:10:16,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:10:16,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:10:16,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:10:16,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:10:16,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:10:16,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:10:16,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:10:16,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:10:16,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:10:16,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:10:16,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32d9f155778c5c4efaa55d37fdad329bb0d271b5 [2019-11-28 20:10:16,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:10:16,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:10:16,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:10:16,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:10:16,991 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:10:16,993 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c [2019-11-28 20:10:17,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35738fff5/cf6aa835999e4c23b2051da1500e2ba7/FLAG139cc9221 [2019-11-28 20:10:17,429 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:10:17,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c [2019-11-28 20:10:17,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35738fff5/cf6aa835999e4c23b2051da1500e2ba7/FLAG139cc9221 [2019-11-28 20:10:17,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35738fff5/cf6aa835999e4c23b2051da1500e2ba7 [2019-11-28 20:10:17,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:10:17,797 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:10:17,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:17,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:10:17,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:10:17,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:17" (1/1) ... [2019-11-28 20:10:17,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f39bd48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:17, skipping insertion in model container [2019-11-28 20:10:17,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:17" (1/1) ... [2019-11-28 20:10:17,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:10:17,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:10:17,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:17,996 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:10:18,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:18,026 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:10:18,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18 WrapperNode [2019-11-28 20:10:18,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:18,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:10:18,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:10:18,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:10:18,041 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:18" (1/1) ... [2019-11-28 20:10:18,041 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:18" (1/1) ... [2019-11-28 20:10:18,109 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:18" (1/1) ... [2019-11-28 20:10:18,109 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:18" (1/1) ... [2019-11-28 20:10:18,117 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:18" (1/1) ... [2019-11-28 20:10:18,127 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:18" (1/1) ... [2019-11-28 20:10:18,131 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:18" (1/1) ... [2019-11-28 20:10:18,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:10:18,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:10:18,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:10:18,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:10:18,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (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:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:10:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:10:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 20:10:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:10:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 20:10:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:10:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:10:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:10:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:10:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:10:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:10:18,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:10:18,794 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:10:18,794 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 20:10:18,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:18 BoogieIcfgContainer [2019-11-28 20:10:18,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:10:18,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:10:18,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:10:18,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:10:18,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:10:17" (1/3) ... [2019-11-28 20:10:18,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdade05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:18, skipping insertion in model container [2019-11-28 20:10:18,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:18" (2/3) ... [2019-11-28 20:10:18,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdade05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:18, skipping insertion in model container [2019-11-28 20:10:18,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:18" (3/3) ... [2019-11-28 20:10:18,805 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5.c [2019-11-28 20:10:18,814 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:10:18,822 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:10:18,834 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:10:18,856 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:10:18,857 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:10:18,857 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:10:18,857 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:10:18,858 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:10:18,858 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:10:18,858 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:10:18,858 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:10:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 20:10:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:10:18,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:18,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:18,888 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:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 20:10:18,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:18,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285196013] [2019-11-28 20:10:18,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,101 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:19,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285196013] [2019-11-28 20:10:19,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:19,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:10:19,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773316946] [2019-11-28 20:10:19,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:19,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:19,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:19,130 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 20:10:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:19,360 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 20:10:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:19,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:10:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:19,379 INFO L225 Difference]: With dead ends: 58 [2019-11-28 20:10:19,379 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:10:19,383 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:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:10:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 20:10:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:10:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 20:10:19,452 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 20:10:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:19,454 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:10:19,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 20:10:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:10:19,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:19,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:19,456 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:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 20:10:19,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:19,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181326847] [2019-11-28 20:10:19,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,612 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:19,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181326847] [2019-11-28 20:10:19,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:19,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:10:19,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086828774] [2019-11-28 20:10:19,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:19,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:19,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:19,616 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-28 20:10:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:19,823 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-28 20:10:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:19,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-28 20:10:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:19,826 INFO L225 Difference]: With dead ends: 59 [2019-11-28 20:10:19,826 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:10:19,828 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:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:10:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-11-28 20:10:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:10:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 20:10:19,837 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-11-28 20:10:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:19,838 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 20:10:19,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 20:10:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:10:19,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:19,839 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:19,840 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:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 20:10:19,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:19,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134244584] [2019-11-28 20:10:19,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:19,973 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:19,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134244584] [2019-11-28 20:10:19,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:19,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:19,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100870071] [2019-11-28 20:10:19,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:19,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:19,984 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-11-28 20:10:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:20,069 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-28 20:10:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:20,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 20:10:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:20,073 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:10:20,073 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:10:20,074 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:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:10:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:10:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:10:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-28 20:10:20,081 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-11-28 20:10:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:20,082 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-28 20:10:20,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-28 20:10:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:10:20,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:20,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:20,084 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:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-11-28 20:10:20,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:20,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077473383] [2019-11-28 20:10:20,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,211 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:20,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077473383] [2019-11-28 20:10:20,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:20,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:20,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771800471] [2019-11-28 20:10:20,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:20,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:20,219 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2019-11-28 20:10:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:20,324 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 20:10:20,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:20,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 20:10:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:20,326 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:10:20,327 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:10:20,327 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:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:10:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 20:10:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:10:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 20:10:20,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-11-28 20:10:20,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:20,334 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 20:10:20,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 20:10:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:10:20,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:20,335 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:20,336 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:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-11-28 20:10:20,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:20,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636629914] [2019-11-28 20:10:20,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,424 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:20,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636629914] [2019-11-28 20:10:20,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649130874] [2019-11-28 20:10:20,425 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:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:20,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:10:20,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:20,534 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:20,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:20,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 20:10:20,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010144543] [2019-11-28 20:10:20,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:20,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:20,538 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2019-11-28 20:10:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:20,709 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 20:10:20,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:20,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 20:10:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:20,712 INFO L225 Difference]: With dead ends: 69 [2019-11-28 20:10:20,712 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 20:10:20,712 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:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 20:10:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-11-28 20:10:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:10:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 20:10:20,725 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-11-28 20:10:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:20,726 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 20:10:20,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-28 20:10:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:10:20,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:20,727 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:20,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:20,940 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:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-11-28 20:10:20,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:20,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068304827] [2019-11-28 20:10:20,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:10:21,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068304827] [2019-11-28 20:10:21,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177101926] [2019-11-28 20:10:21,056 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:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:10:21,115 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:10:21,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:21,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-11-28 20:10:21,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141796722] [2019-11-28 20:10:21,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:10:21,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:10:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:21,123 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 3 states. [2019-11-28 20:10:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:21,150 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-28 20:10:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:10:21,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 20:10:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:21,152 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:10:21,152 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 20:10:21,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 20:10:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-11-28 20:10:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:10:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-11-28 20:10:21,159 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-11-28 20:10:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:21,160 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-28 20:10:21,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:10:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-11-28 20:10:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:10:21,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:21,162 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:21,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:21,363 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:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-11-28 20:10:21,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:21,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945912496] [2019-11-28 20:10:21,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:21,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945912496] [2019-11-28 20:10:21,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221891103] [2019-11-28 20:10:21,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:21,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:21,502 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:21,579 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 20:10:21,580 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:10:21,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:21,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:21,592 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:21,592 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-28 20:10:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:21,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:21,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 20:10:21,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833050081] [2019-11-28 20:10:21,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:10:21,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:21,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:10:21,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:21,646 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 8 states. [2019-11-28 20:10:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:21,817 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-11-28 20:10:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:10:21,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 20:10:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:21,819 INFO L225 Difference]: With dead ends: 53 [2019-11-28 20:10:21,819 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:10:21,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:10:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 20:10:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:10:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-28 20:10:21,825 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-11-28 20:10:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:21,825 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-28 20:10:21,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:10:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-28 20:10:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:10:21,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:21,827 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:22,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:22,028 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:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:22,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-11-28 20:10:22,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:22,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519998409] [2019-11-28 20:10:22,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:22,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519998409] [2019-11-28 20:10:22,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791247881] [2019-11-28 20:10:22,173 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:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 20:10:22,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:22,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:22,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 20:10:22,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:22,271 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-28 20:10:22,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:10:22,273 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-28 20:10:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:22,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:22,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-28 20:10:22,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450942426] [2019-11-28 20:10:22,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:10:22,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:10:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:22,360 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 10 states. [2019-11-28 20:10:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:22,623 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-28 20:10:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:10:22,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 20:10:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:22,624 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:10:22,625 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:10:22,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:10:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:10:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-28 20:10:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:10:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-28 20:10:22,631 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-11-28 20:10:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:22,631 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-28 20:10:22,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:10:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-28 20:10:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:10:22,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:22,633 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:22,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:22,837 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:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-11-28 20:10:22,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:22,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961757271] [2019-11-28 20:10:22,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:22,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961757271] [2019-11-28 20:10:22,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884274359] [2019-11-28 20:10:22,944 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:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:22,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:10:22,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:23,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:23,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-11-28 20:10:23,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238374165] [2019-11-28 20:10:23,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:23,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:23,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:10:23,034 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-28 20:10:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:23,143 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-28 20:10:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:23,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 20:10:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:23,145 INFO L225 Difference]: With dead ends: 62 [2019-11-28 20:10:23,145 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:10:23,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:10:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-11-28 20:10:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:10:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 20:10:23,150 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2019-11-28 20:10:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:23,150 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 20:10:23,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-28 20:10:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:10:23,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:23,151 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:23,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:23,355 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:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-11-28 20:10:23,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:23,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28021697] [2019-11-28 20:10:23,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,434 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:23,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28021697] [2019-11-28 20:10:23,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236743084] [2019-11-28 20:10:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:23,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:10:23,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:23,539 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:23,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:23,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-28 20:10:23,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149334434] [2019-11-28 20:10:23,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:10:23,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:23,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:10:23,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:23,546 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 12 states. [2019-11-28 20:10:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:23,840 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-11-28 20:10:23,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:10:23,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 20:10:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:23,841 INFO L225 Difference]: With dead ends: 79 [2019-11-28 20:10:23,842 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 20:10:23,842 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:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 20:10:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-11-28 20:10:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 20:10:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-28 20:10:23,859 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2019-11-28 20:10:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:23,860 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-28 20:10:23,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:10:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-28 20:10:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:10:23,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:23,862 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:24,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:24,067 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:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:24,067 INFO L82 PathProgramCache]: Analyzing trace with hash -790766996, now seen corresponding path program 1 times [2019-11-28 20:10:24,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:24,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643618738] [2019-11-28 20:10:24,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 20:10:24,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643618738] [2019-11-28 20:10:24,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610712862] [2019-11-28 20:10:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:10:24,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:24,221 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_25|]} [2019-11-28 20:10:24,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:24,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:10:24,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:24,239 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:24,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:24,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 20:10:24,248 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:24,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:24,257 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:24,258 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 20:10:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 20:10:24,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:24,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-28 20:10:24,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429195176] [2019-11-28 20:10:24,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:10:24,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:24,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:10:24,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:10:24,377 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 9 states. [2019-11-28 20:10:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:24,611 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-11-28 20:10:24,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:10:24,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-28 20:10:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:24,613 INFO L225 Difference]: With dead ends: 67 [2019-11-28 20:10:24,613 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:10:24,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:10:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-11-28 20:10:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 20:10:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-28 20:10:24,629 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 31 [2019-11-28 20:10:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:24,630 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-28 20:10:24,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:10:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-28 20:10:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 20:10:24,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:24,633 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] [2019-11-28 20:10:24,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:24,838 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:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash 894123677, now seen corresponding path program 1 times [2019-11-28 20:10:24,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:24,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246256400] [2019-11-28 20:10:24,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,903 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:24,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246256400] [2019-11-28 20:10:24,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844058183] [2019-11-28 20:10:24,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:24,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:10:24,947 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:24,971 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:24,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:24,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 20:10:24,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910269673] [2019-11-28 20:10:24,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:10:24,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:24,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:10:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:24,974 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 7 states. [2019-11-28 20:10:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:25,099 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-11-28 20:10:25,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:25,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-28 20:10:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:25,101 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:10:25,101 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 20:10:25,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 20:10:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2019-11-28 20:10:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 20:10:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-11-28 20:10:25,106 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 37 [2019-11-28 20:10:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:25,107 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-11-28 20:10:25,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:10:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-11-28 20:10:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:10:25,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:25,108 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:25,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:25,312 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:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2019-11-28 20:10:25,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:25,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548707199] [2019-11-28 20:10:25,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:10:25,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548707199] [2019-11-28 20:10:25,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469583908] [2019-11-28 20:10:25,395 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:25,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:10:25,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:25,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:10:25,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 20:10:25,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:25,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-28 20:10:25,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910778199] [2019-11-28 20:10:25,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 20:10:25,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:10:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:10:25,550 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 16 states. [2019-11-28 20:10:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:26,026 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-11-28 20:10:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:10:26,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-11-28 20:10:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:26,029 INFO L225 Difference]: With dead ends: 117 [2019-11-28 20:10:26,029 INFO L226 Difference]: Without dead ends: 117 [2019-11-28 20:10:26,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:10:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-28 20:10:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2019-11-28 20:10:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 20:10:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-11-28 20:10:26,036 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 43 [2019-11-28 20:10:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:26,036 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-11-28 20:10:26,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 20:10:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-11-28 20:10:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 20:10:26,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:26,038 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:26,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:26,242 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:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2073773289, now seen corresponding path program 2 times [2019-11-28 20:10:26,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:26,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356772360] [2019-11-28 20:10:26,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:10:26,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356772360] [2019-11-28 20:10:26,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853265030] [2019-11-28 20:10:26,369 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:26,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:10:26,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:26,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:26,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:10:26,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:26,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-11-28 20:10:26,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592653292] [2019-11-28 20:10:26,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:10:26,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:26,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:10:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:10:26,497 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 14 states. [2019-11-28 20:10:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:26,981 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2019-11-28 20:10:26,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:10:26,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-28 20:10:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:26,983 INFO L225 Difference]: With dead ends: 122 [2019-11-28 20:10:26,983 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 20:10:26,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:10:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 20:10:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2019-11-28 20:10:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 20:10:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2019-11-28 20:10:26,988 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 47 [2019-11-28 20:10:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:26,988 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2019-11-28 20:10:26,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:10:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2019-11-28 20:10:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 20:10:26,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:26,989 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:27,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:27,198 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:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:27,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1381084076, now seen corresponding path program 3 times [2019-11-28 20:10:27,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:27,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595006144] [2019-11-28 20:10:27,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:10:27,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595006144] [2019-11-28 20:10:27,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507926386] [2019-11-28 20:10:27,403 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:27,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 20:10:27,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:27,449 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:10:27,459 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:27,468 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_14|], 1=[|v_#valid_26|]} [2019-11-28 20:10:27,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:27,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:10:27,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:27,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:27,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:27,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 20:10:27,487 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:27,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:27,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:27,495 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-28 20:10:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 20:10:27,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:27,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2019-11-28 20:10:27,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209447526] [2019-11-28 20:10:27,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 20:10:27,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:27,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 20:10:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:10:27,824 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 18 states. [2019-11-28 20:10:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:29,109 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2019-11-28 20:10:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 20:10:29,111 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-28 20:10:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:29,114 INFO L225 Difference]: With dead ends: 126 [2019-11-28 20:10:29,114 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 20:10:29,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 20:10:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 20:10:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-28 20:10:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 20:10:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2019-11-28 20:10:29,123 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 52 [2019-11-28 20:10:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:29,123 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2019-11-28 20:10:29,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 20:10:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2019-11-28 20:10:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-28 20:10:29,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:29,126 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:29,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:29,332 INFO L410 AbstractCegarLoop]: === Iteration 16 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash -185613816, now seen corresponding path program 2 times [2019-11-28 20:10:29,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:29,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992124888] [2019-11-28 20:10:29,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-11-28 20:10:29,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992124888] [2019-11-28 20:10:29,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347057577] [2019-11-28 20:10:29,520 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:29,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:29,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:29,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:29,578 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:29,590 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_27|]} [2019-11-28 20:10:29,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:29,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:10:29,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:29,616 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:29,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:29,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 20:10:29,622 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:29,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:29,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:29,632 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-28 20:10:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-11-28 20:10:30,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:30,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2019-11-28 20:10:30,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842490134] [2019-11-28 20:10:30,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:30,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:10:30,067 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 6 states. [2019-11-28 20:10:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:30,110 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-28 20:10:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:30,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-11-28 20:10:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:30,112 INFO L225 Difference]: With dead ends: 118 [2019-11-28 20:10:30,112 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 20:10:30,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:10:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 20:10:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-28 20:10:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 20:10:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2019-11-28 20:10:30,117 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 126 [2019-11-28 20:10:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:30,118 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2019-11-28 20:10:30,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2019-11-28 20:10:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 20:10:30,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:30,120 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:30,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:30,324 INFO L410 AbstractCegarLoop]: === Iteration 17 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:30,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1998281440, now seen corresponding path program 1 times [2019-11-28 20:10:30,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:30,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607128302] [2019-11-28 20:10:30,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-11-28 20:10:30,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607128302] [2019-11-28 20:10:30,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413754436] [2019-11-28 20:10:30,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:10:30,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 326 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-28 20:10:30,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:30,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 20:10:30,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140362552] [2019-11-28 20:10:30,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 20:10:30,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:30,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 20:10:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:10:30,680 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 18 states. [2019-11-28 20:10:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:31,355 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2019-11-28 20:10:31,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 20:10:31,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 129 [2019-11-28 20:10:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:31,358 INFO L225 Difference]: With dead ends: 181 [2019-11-28 20:10:31,358 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 20:10:31,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-11-28 20:10:31,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 20:10:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 133. [2019-11-28 20:10:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 20:10:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2019-11-28 20:10:31,366 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 129 [2019-11-28 20:10:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:31,366 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2019-11-28 20:10:31,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 20:10:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2019-11-28 20:10:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-28 20:10:31,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:31,369 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:31,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:31,573 INFO L410 AbstractCegarLoop]: === Iteration 18 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1503661553, now seen corresponding path program 2 times [2019-11-28 20:10:31,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:31,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438769192] [2019-11-28 20:10:31,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-11-28 20:10:31,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438769192] [2019-11-28 20:10:31,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747900163] [2019-11-28 20:10:31,745 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:31,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:31,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:31,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:31,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:31,851 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:31,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:31,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:31,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:31,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:31,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:31,915 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:31,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:31,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:31,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:31,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:31,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:31,991 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:31,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:31,992 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:31,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:31,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:32,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:32,079 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:32,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:32,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:32,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:32,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:32,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:32,176 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:32,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:32,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:32,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:32,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:32,184 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:32,305 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:32,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:32,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:32,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:32,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:32,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:32,418 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:32,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:32,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:32,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:32,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:32,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2019-11-28 20:10:32,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:32,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2019-11-28 20:10:32,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344218991] [2019-11-28 20:10:32,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:32,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:10:32,694 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 6 states. [2019-11-28 20:10:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:32,793 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2019-11-28 20:10:32,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:32,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-11-28 20:10:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:32,794 INFO L225 Difference]: With dead ends: 132 [2019-11-28 20:10:32,794 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:10:32,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:10:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:10:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:10:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:10:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:10:32,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2019-11-28 20:10:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:32,796 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:10:32,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:10:32,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:10:32,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:33,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:10:33 BoogieIcfgContainer [2019-11-28 20:10:33,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:10:33,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:10:33,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:10:33,002 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:10:33,003 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:18" (3/4) ... [2019-11-28 20:10:33,006 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:10:33,012 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:10:33,012 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 20:10:33,013 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:10:33,020 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-28 20:10:33,020 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 20:10:33,021 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:10:33,021 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:10:33,066 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:10:33,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:10:33,068 INFO L168 Benchmark]: Toolchain (without parser) took 15270.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.7 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -252.2 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:33,068 INFO L168 Benchmark]: CDTParser took 0.40 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:33,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:33,069 INFO L168 Benchmark]: Boogie Preprocessor took 111.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:33,069 INFO L168 Benchmark]: RCFGBuilder took 657.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:33,069 INFO L168 Benchmark]: TraceAbstraction took 14204.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.7 MB). Peak memory consumption was 106.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:33,070 INFO L168 Benchmark]: Witness Printer took 64.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:10:33,072 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.40 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 228.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 657.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14204.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.7 MB). Peak memory consumption was 106.5 MB. Max. memory is 11.5 GB. * Witness Printer took 64.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Result: SAFE, OverallTime: 14.1s, OverallIterations: 18, TraceHistogramMax: 15, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 439 SDtfs, 1305 SDslu, 990 SDs, 0 SdLazy, 2875 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1058 GetRequests, 807 SyntacticMatches, 38 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=17, 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, 18 MinimizatonAttempts, 200 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1595 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1563 ConstructedInterpolants, 312 QuantifiedInterpolants, 931419 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1856 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 3500/3920 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...