./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:37:25,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:37:25,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:37:25,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:37:25,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:37:25,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:37:25,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:37:25,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:37:25,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:37:25,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:37:25,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:37:25,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:37:25,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:37:25,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:37:25,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:37:25,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:37:25,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:37:25,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:37:25,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:37:25,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:37:25,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:37:25,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:37:25,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:37:25,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:37:25,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:37:25,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:37:25,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:37:25,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:37:25,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:37:25,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:37:25,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:37:25,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:37:25,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:37:25,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:37:25,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:37:25,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:37:25,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:37:25,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:37:25,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:37:25,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:37:25,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:37:25,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:37:25,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:37:25,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:37:25,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:37:25,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:37:25,955 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:37:25,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:37:25,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:37:25,956 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:37:25,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:37:25,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:37:25,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:37:25,957 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:37:25,958 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:37:25,958 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:37:25,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:37:25,959 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:37:25,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:37:25,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:37:25,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:37:25,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:37:25,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:37:25,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:37:25,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:25,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:37:25,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:37:25,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:37:25,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:37:25,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2019-11-28 02:37:26,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:37:26,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:37:26,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:37:26,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:37:26,304 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:37:26,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2019-11-28 02:37:26,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb661997/9daacde5740d41ff8284d1acf1eb99d6/FLAGe821dbba3 [2019-11-28 02:37:26,794 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:37:26,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2019-11-28 02:37:26,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb661997/9daacde5740d41ff8284d1acf1eb99d6/FLAGe821dbba3 [2019-11-28 02:37:27,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb661997/9daacde5740d41ff8284d1acf1eb99d6 [2019-11-28 02:37:27,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:37:27,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:37:27,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:27,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:37:27,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:37:27,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b24835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27, skipping insertion in model container [2019-11-28 02:37:27,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:37:27,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:37:27,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:27,410 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:37:27,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:27,441 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:37:27,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27 WrapperNode [2019-11-28 02:37:27,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:27,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:37:27,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:37:27,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:37:27,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... [2019-11-28 02:37:27,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:37:27,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:37:27,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:37:27,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:37:27,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:37:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:37:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 02:37:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:37:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 02:37:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:37:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:37:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:37:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:37:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:37:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:37:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:37:27,911 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:37:27,911 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 02:37:27,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:27 BoogieIcfgContainer [2019-11-28 02:37:27,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:37:27,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:37:27,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:37:27,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:37:27,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:37:27" (1/3) ... [2019-11-28 02:37:27,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6c5512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:27, skipping insertion in model container [2019-11-28 02:37:27,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:27" (2/3) ... [2019-11-28 02:37:27,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6c5512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:27, skipping insertion in model container [2019-11-28 02:37:27,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:27" (3/3) ... [2019-11-28 02:37:27,921 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength.c [2019-11-28 02:37:27,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:37:27,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:37:27,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:37:27,963 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:37:27,964 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:37:27,964 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:37:27,964 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:37:27,964 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:37:27,964 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:37:27,964 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:37:27,965 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:37:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 02:37:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:37:27,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:27,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:27,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 02:37:28,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:28,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441228171] [2019-11-28 02:37:28,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:28,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441228171] [2019-11-28 02:37:28,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:28,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:37:28,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144853810] [2019-11-28 02:37:28,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:28,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:28,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:28,196 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 02:37:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:28,406 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 02:37:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:28,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:37:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:28,420 INFO L225 Difference]: With dead ends: 58 [2019-11-28 02:37:28,421 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:28,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 02:37:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 02:37:28,464 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 02:37:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:28,465 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 02:37:28,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 02:37:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:37:28,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:28,466 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:28,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 02:37:28,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:28,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318424553] [2019-11-28 02:37:28,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:28,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318424553] [2019-11-28 02:37:28,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:28,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:37:28,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967052586] [2019-11-28 02:37:28,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:28,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:28,613 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-28 02:37:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:28,801 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-28 02:37:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:28,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-28 02:37:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:28,804 INFO L225 Difference]: With dead ends: 59 [2019-11-28 02:37:28,804 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 02:37:28,806 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 02:37:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 02:37:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-11-28 02:37:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:37:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 02:37:28,814 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-11-28 02:37:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:28,815 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 02:37:28,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 02:37:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:37:28,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:28,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:28,817 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:28,817 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 02:37:28,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:28,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447554308] [2019-11-28 02:37:28,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:28,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447554308] [2019-11-28 02:37:28,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:28,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:28,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261566161] [2019-11-28 02:37:28,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:28,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:28,917 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-11-28 02:37:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:28,995 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-28 02:37:28,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:28,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:37:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:29,002 INFO L225 Difference]: With dead ends: 43 [2019-11-28 02:37:29,004 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 02:37:29,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 02:37:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 02:37:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:37:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-28 02:37:29,016 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-11-28 02:37:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:29,017 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-28 02:37:29,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-28 02:37:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:37:29,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:29,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:29,019 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-11-28 02:37:29,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:29,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458595333] [2019-11-28 02:37:29,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:29,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458595333] [2019-11-28 02:37:29,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:29,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:29,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587419379] [2019-11-28 02:37:29,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:29,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:29,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:29,120 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2019-11-28 02:37:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:29,224 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 02:37:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:29,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:37:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:29,226 INFO L225 Difference]: With dead ends: 47 [2019-11-28 02:37:29,227 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 02:37:29,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 02:37:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 02:37:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:37:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 02:37:29,235 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-11-28 02:37:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:29,236 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 02:37:29,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 02:37:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:37:29,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:29,238 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 02:37:29,238 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-11-28 02:37:29,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:29,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181067210] [2019-11-28 02:37:29,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,348 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 02:37:29,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181067210] [2019-11-28 02:37:29,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076662573] [2019-11-28 02:37:29,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:37:29,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:29,466 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 02:37:29,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:29,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 02:37:29,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002598939] [2019-11-28 02:37:29,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:29,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:29,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:29,469 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2019-11-28 02:37:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:29,590 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 02:37:29,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:29,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 02:37:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:29,592 INFO L225 Difference]: With dead ends: 69 [2019-11-28 02:37:29,592 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:37:29,593 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 02:37:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:37:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-11-28 02:37:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:37:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 02:37:29,601 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-11-28 02:37:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:29,601 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 02:37:29,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-28 02:37:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:37:29,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:29,603 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 02:37:29,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:29,815 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-11-28 02:37:29,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:29,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583421569] [2019-11-28 02:37:29,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:37:29,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583421569] [2019-11-28 02:37:29,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:29,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:37:29,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772813963] [2019-11-28 02:37:29,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:29,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:29,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:29,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:29,904 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2019-11-28 02:37:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:30,054 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-28 02:37:30,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:30,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 02:37:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:30,055 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:37:30,056 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 02:37:30,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:37:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 02:37:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-11-28 02:37:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:37:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-11-28 02:37:30,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-11-28 02:37:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:30,063 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-28 02:37:30,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-11-28 02:37:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:37:30,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:30,064 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 02:37:30,065 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-11-28 02:37:30,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:30,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66963180] [2019-11-28 02:37:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:30,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66963180] [2019-11-28 02:37:30,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:30,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:37:30,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813121156] [2019-11-28 02:37:30,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:30,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:30,135 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2019-11-28 02:37:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:30,248 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-11-28 02:37:30,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:30,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-28 02:37:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:30,250 INFO L225 Difference]: With dead ends: 53 [2019-11-28 02:37:30,250 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 02:37:30,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 02:37:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 02:37:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 02:37:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-28 02:37:30,260 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-11-28 02:37:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:30,260 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-28 02:37:30,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-28 02:37:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:37:30,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:30,262 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 02:37:30,262 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:30,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-11-28 02:37:30,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:30,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367637980] [2019-11-28 02:37:30,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:30,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367637980] [2019-11-28 02:37:30,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:30,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:37:30,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551762951] [2019-11-28 02:37:30,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:37:30,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:37:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:30,473 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 10 states. [2019-11-28 02:37:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:30,752 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-28 02:37:30,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:37:30,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 02:37:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:30,753 INFO L225 Difference]: With dead ends: 55 [2019-11-28 02:37:30,753 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 02:37:30,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:37:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 02:37:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-28 02:37:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:37:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-28 02:37:30,759 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-11-28 02:37:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:30,759 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-28 02:37:30,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:37:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-28 02:37:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:37:30,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:30,761 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 02:37:30,761 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-11-28 02:37:30,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:30,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814256066] [2019-11-28 02:37:30,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:37:30,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814256066] [2019-11-28 02:37:30,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:30,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:37:30,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370471340] [2019-11-28 02:37:30,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:37:30,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:37:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:30,881 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 7 states. [2019-11-28 02:37:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:31,018 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-28 02:37:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:31,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 02:37:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:31,019 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:37:31,019 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 02:37:31,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 02:37:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-11-28 02:37:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 02:37:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-11-28 02:37:31,024 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2019-11-28 02:37:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:31,024 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-11-28 02:37:31,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:37:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-11-28 02:37:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:37:31,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:31,026 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 02:37:31,026 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-11-28 02:37:31,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:31,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563790897] [2019-11-28 02:37:31,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,101 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 02:37:31,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563790897] [2019-11-28 02:37:31,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942550176] [2019-11-28 02:37:31,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:37:31,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:31,194 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 02:37:31,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:31,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-28 02:37:31,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613395592] [2019-11-28 02:37:31,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:37:31,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:31,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:37:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:31,199 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 12 states. [2019-11-28 02:37:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:31,436 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-28 02:37:31,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:37:31,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 02:37:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:31,437 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:37:31,437 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:37:31,438 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 02:37:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:37:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2019-11-28 02:37:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 02:37:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-28 02:37:31,443 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2019-11-28 02:37:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:31,443 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-28 02:37:31,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:37:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-28 02:37:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:37:31,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:31,445 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:31,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:31,649 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:31,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1979886526, now seen corresponding path program 2 times [2019-11-28 02:37:31,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:31,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582644972] [2019-11-28 02:37:31,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:37:31,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582644972] [2019-11-28 02:37:31,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147880635] [2019-11-28 02:37:31,705 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:31,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:31,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:31,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:37:31,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:31,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:37:31,798 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:31,804 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:31,804 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:37:31,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 02:37:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 02:37:31,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:31,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-28 02:37:31,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44597638] [2019-11-28 02:37:31,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:31,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:31,919 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2019-11-28 02:37:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:31,953 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-28 02:37:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:31,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 02:37:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:31,954 INFO L225 Difference]: With dead ends: 61 [2019-11-28 02:37:31,954 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 02:37:31,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 02:37:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-28 02:37:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 02:37:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-11-28 02:37:31,963 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 32 [2019-11-28 02:37:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:31,963 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-11-28 02:37:31,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-11-28 02:37:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:37:31,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:31,965 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:32,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:32,174 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 02:37:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash -13619034, now seen corresponding path program 1 times [2019-11-28 02:37:32,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:32,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269091420] [2019-11-28 02:37:32,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:37:32,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269091420] [2019-11-28 02:37:32,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896517272] [2019-11-28 02:37:32,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:37:32,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:32,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:32,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-11-28 02:37:32,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554792100] [2019-11-28 02:37:32,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:32,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:32,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:32,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:32,360 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2019-11-28 02:37:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:32,466 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-11-28 02:37:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:32,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-28 02:37:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:32,467 INFO L225 Difference]: With dead ends: 73 [2019-11-28 02:37:32,468 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 02:37:32,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 02:37:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-28 02:37:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 02:37:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-28 02:37:32,473 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 35 [2019-11-28 02:37:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:32,473 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-28 02:37:32,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-28 02:37:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 02:37:32,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:32,475 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:32,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:32,680 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 02:37:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:32,681 INFO L82 PathProgramCache]: Analyzing trace with hash -548707221, now seen corresponding path program 1 times [2019-11-28 02:37:32,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:32,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089122642] [2019-11-28 02:37:32,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,743 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 02:37:32,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089122642] [2019-11-28 02:37:32,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807180506] [2019-11-28 02:37:32,744 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 02:37:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:32,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:37:32,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:32,813 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 02:37:32,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:32,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 02:37:32,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961741468] [2019-11-28 02:37:32,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:37:32,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:37:32,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:32,815 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 7 states. [2019-11-28 02:37:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:32,923 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-28 02:37:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:32,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-28 02:37:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:32,924 INFO L225 Difference]: With dead ends: 87 [2019-11-28 02:37:32,925 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 02:37:32,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 02:37:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-11-28 02:37:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 02:37:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-11-28 02:37:32,937 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2019-11-28 02:37:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:32,937 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-11-28 02:37:32,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:37:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-11-28 02:37:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:37:32,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:32,942 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 02:37:33,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:33,151 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 02:37:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2019-11-28 02:37:33,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:33,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260301184] [2019-11-28 02:37:33,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:37:33,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260301184] [2019-11-28 02:37:33,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569577790] [2019-11-28 02:37:33,242 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:33,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:37:33,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:33,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:33,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 02:37:33,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:33,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-11-28 02:37:33,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937969568] [2019-11-28 02:37:33,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:37:33,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:37:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:33,334 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 8 states. [2019-11-28 02:37:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:33,472 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-28 02:37:33,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:33,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-11-28 02:37:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:33,473 INFO L225 Difference]: With dead ends: 72 [2019-11-28 02:37:33,473 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 02:37:33,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 02:37:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-11-28 02:37:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:37:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-11-28 02:37:33,477 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 43 [2019-11-28 02:37:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:33,477 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-11-28 02:37:33,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:37:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-11-28 02:37:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 02:37:33,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:33,479 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:33,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:33,680 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 02:37:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1444841842, now seen corresponding path program 2 times [2019-11-28 02:37:33,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:33,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944535292] [2019-11-28 02:37:33,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 02:37:33,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944535292] [2019-11-28 02:37:33,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534162713] [2019-11-28 02:37:33,757 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:33,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:33,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:33,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:37:33,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:33,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-28 02:37:33,850 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:33,854 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:33,854 INFO L508 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 02:37:33,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 02:37:33,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-28 02:37:33,888 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:33,891 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:33,892 INFO L508 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 02:37:33,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 02:37:33,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-28 02:37:33,930 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:33,933 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:33,933 INFO L508 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 02:37:33,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-28 02:37:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-28 02:37:34,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:34,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2019-11-28 02:37:34,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440368296] [2019-11-28 02:37:34,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:34,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:34,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:34,014 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2019-11-28 02:37:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:34,092 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-11-28 02:37:34,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:34,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-28 02:37:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:34,094 INFO L225 Difference]: With dead ends: 67 [2019-11-28 02:37:34,094 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:37:34,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:37:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:37:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:37:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:37:34,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-28 02:37:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:34,098 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:37:34,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:37:34,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:37:34,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:34,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:37:34 BoogieIcfgContainer [2019-11-28 02:37:34,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:37:34,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:37:34,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:37:34,309 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:37:34,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:27" (3/4) ... [2019-11-28 02:37:34,313 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:37:34,320 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:37:34,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 02:37:34,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:37:34,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 02:37:34,331 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 02:37:34,331 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:37:34,331 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:37:34,383 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:37:34,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:37:34,385 INFO L168 Benchmark]: Toolchain (without parser) took 7209.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 959.0 MB in the beginning and 847.4 MB in the end (delta: 111.6 MB). Peak memory consumption was 306.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:34,385 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:34,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:34,387 INFO L168 Benchmark]: Boogie Preprocessor took 83.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:34,387 INFO L168 Benchmark]: RCFGBuilder took 386.25 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:34,388 INFO L168 Benchmark]: TraceAbstraction took 6392.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 854.9 MB in the end (delta: 236.6 MB). Peak memory consumption was 304.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:34,388 INFO L168 Benchmark]: Witness Printer took 75.51 ms. Allocated memory is still 1.2 GB. Free memory was 854.9 MB in the beginning and 847.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:34,391 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.23 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 265.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.25 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6392.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 854.9 MB in the end (delta: 236.6 MB). Peak memory consumption was 304.7 MB. Max. memory is 11.5 GB. * Witness Printer took 75.51 ms. Allocated memory is still 1.2 GB. Free memory was 854.9 MB in the beginning and 847.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Result: SAFE, OverallTime: 6.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 353 SDtfs, 602 SDslu, 559 SDs, 0 SdLazy, 1287 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 306 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 103 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 653 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 631 ConstructedInterpolants, 36 QuantifiedInterpolants, 74548 SizeOfPredicates, 11 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 22 InterpolantComputations, 11 PerfectInterpolantSequences, 215/277 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...