./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-2.i --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/memsafety/test-0019-2.i -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 a9fb1ca01555f439b860fec974f930b68e3dc780 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 a9fb1ca01555f439b860fec974f930b68e3dc780 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (exists ((v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (bvadd |alloc_data_#in~pdata.offset| (_ bv4 32)))) (or (not (bvule (bvadd alloc_data_~pdata.offset (_ bv8 32)) v_arrayElimCell_19)) (and (not (= v_arrayElimCell_19 v_arrayElimCell_18)) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base)) (and (not (bvule .cse0 v_arrayElimCell_17)) (bvule (bvadd |alloc_data_#in~pdata.offset| (_ bv8 32)) v_arrayElimCell_17)) (not (bvule |alloc_data_#in~pdata.offset| .cse0)) (bvule .cse0 v_arrayElimCell_18))))) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:34:39,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:34:39,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:34:39,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:34:39,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:34:39,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:34:39,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:34:39,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:34:39,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:34:39,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:34:39,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:34:39,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:34:39,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:34:39,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:34:39,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:34:39,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:34:39,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:34:39,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:34:39,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:34:39,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:34:39,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:34:39,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:34:39,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:34:39,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:34:39,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:34:39,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:34:39,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:34:39,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:34:39,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:34:39,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:34:39,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:34:39,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:34:39,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:34:39,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:34:39,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:34:39,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:34:39,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:34:39,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:34:39,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:34:39,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:34:39,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:34:39,716 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:34:39,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:34:39,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:34:39,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:34:39,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:34:39,733 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:34:39,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:34:39,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:34:39,734 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:34:39,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:34:39,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:34:39,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:34:39,735 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:34:39,735 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:34:39,739 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:34:39,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:34:39,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:34:39,739 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:34:39,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:34:39,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:34:39,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:34:39,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:34:39,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:34:39,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:34:39,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:34:39,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:34:39,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:34:39,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:34:39,742 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 -> a9fb1ca01555f439b860fec974f930b68e3dc780 [2019-11-28 02:34:40,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:34:40,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:34:40,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:34:40,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:34:40,052 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:34:40,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 02:34:40,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65bf2caa8/b460000aa5284f3aa48d82af7c4a0f90/FLAGb390578ad [2019-11-28 02:34:40,582 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:34:40,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 02:34:40,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65bf2caa8/b460000aa5284f3aa48d82af7c4a0f90/FLAGb390578ad [2019-11-28 02:34:40,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65bf2caa8/b460000aa5284f3aa48d82af7c4a0f90 [2019-11-28 02:34:40,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:34:40,933 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:34:40,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:34:40,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:34:40,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:34:40,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:34:40" (1/1) ... [2019-11-28 02:34:40,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca2e8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:40, skipping insertion in model container [2019-11-28 02:34:40,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:34:40" (1/1) ... [2019-11-28 02:34:40,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:34:40,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:34:41,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:34:41,352 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:34:41,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:34:41,450 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:34:41,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41 WrapperNode [2019-11-28 02:34:41,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:34:41,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:34:41,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:34:41,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:34:41,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (1/1) ... [2019-11-28 02:34:41,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (1/1) ... [2019-11-28 02:34:41,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (1/1) ... [2019-11-28 02:34:41,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (1/1) ... [2019-11-28 02:34:41,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (1/1) ... [2019-11-28 02:34:41,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (1/1) ... [2019-11-28 02:34:41,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (1/1) ... [2019-11-28 02:34:41,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:34:41,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:34:41,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:34:41,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:34:41,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (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:34:41,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:34:41,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:34:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:34:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:34:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 02:34:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 02:34:41,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 02:34:41,590 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-28 02:34:41,590 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-28 02:34:41,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:34:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:34:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:34:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:34:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:34:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:34:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:34:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:34:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:34:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:34:41,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:34:41,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:34:41,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:34:41,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:34:41,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:34:41,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:34:41,594 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:34:41,594 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:34:41,594 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:34:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:34:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 02:34:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 02:34:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 02:34:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:34:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:34:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:34:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:34:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:34:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:34:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:34:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:34:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:34:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:34:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:34:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:34:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:34:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:34:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:34:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:34:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:34:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:34:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:34:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:34:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:34:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:34:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:34:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:34:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:34:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:34:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:34:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:34:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:34:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:34:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:34:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:34:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:34:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:34:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:34:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:34:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:34:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:34:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:34:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:34:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:34:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:34:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:34:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:34:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:34:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:34:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:34:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:34:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:34:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:34:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:34:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:34:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:34:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:34:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:34:41,611 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:34:41,611 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:34:41,611 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:34:41,611 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:34:41,611 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:34:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:34:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:34:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:34:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:34:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:34:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:34:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:34:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:34:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:34:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-28 02:34:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:34:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:34:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-28 02:34:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:34:41,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:34:41,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:34:41,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:34:41,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:34:41,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:34:42,289 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:34:42,289 INFO L297 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 02:34:42,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:34:42 BoogieIcfgContainer [2019-11-28 02:34:42,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:34:42,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:34:42,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:34:42,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:34:42,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:34:40" (1/3) ... [2019-11-28 02:34:42,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a47097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:34:42, skipping insertion in model container [2019-11-28 02:34:42,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:41" (2/3) ... [2019-11-28 02:34:42,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a47097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:34:42, skipping insertion in model container [2019-11-28 02:34:42,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:34:42" (3/3) ... [2019-11-28 02:34:42,306 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2019-11-28 02:34:42,317 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:34:42,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-28 02:34:42,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-28 02:34:42,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:34:42,380 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:34:42,381 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:34:42,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:34:42,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:34:42,383 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:34:42,383 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:34:42,384 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:34:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-11-28 02:34:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:34:42,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:42,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:42,425 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:42,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1314455937, now seen corresponding path program 1 times [2019-11-28 02:34:42,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:42,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464319325] [2019-11-28 02:34:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:42,692 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:34:42,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464319325] [2019-11-28 02:34:42,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:42,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:34:42,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321848201] [2019-11-28 02:34:42,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:34:42,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:34:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:34:42,720 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 6 states. [2019-11-28 02:34:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:43,112 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-11-28 02:34:43,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:34:43,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 02:34:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:43,123 INFO L225 Difference]: With dead ends: 61 [2019-11-28 02:34:43,124 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 02:34:43,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:34:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 02:34:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-11-28 02:34:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:34:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-28 02:34:43,165 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-11-28 02:34:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:43,166 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-28 02:34:43,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:34:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-28 02:34:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:34:43,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:43,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:43,168 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1314455936, now seen corresponding path program 1 times [2019-11-28 02:34:43,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:43,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370271998] [2019-11-28 02:34:43,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:43,295 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:34:43,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370271998] [2019-11-28 02:34:43,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:43,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:34:43,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852508570] [2019-11-28 02:34:43,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:34:43,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:43,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:34:43,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:34:43,300 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 6 states. [2019-11-28 02:34:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:43,549 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-11-28 02:34:43,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:34:43,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 02:34:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:43,551 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:34:43,551 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 02:34:43,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:34:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 02:34:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-11-28 02:34:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:34:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-28 02:34:43,559 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-11-28 02:34:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:43,560 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-28 02:34:43,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:34:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-28 02:34:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:34:43,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:43,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:43,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:43,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:43,562 INFO L82 PathProgramCache]: Analyzing trace with hash -471770815, now seen corresponding path program 1 times [2019-11-28 02:34:43,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:43,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209222261] [2019-11-28 02:34:43,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:43,714 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:34:43,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209222261] [2019-11-28 02:34:43,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:43,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:34:43,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765321909] [2019-11-28 02:34:43,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:34:43,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:43,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:34:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:34:43,718 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 7 states. [2019-11-28 02:34:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:43,961 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-28 02:34:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:34:43,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 02:34:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:43,964 INFO L225 Difference]: With dead ends: 56 [2019-11-28 02:34:43,964 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 02:34:43,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:34:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 02:34:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-11-28 02:34:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 02:34:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-11-28 02:34:43,976 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-11-28 02:34:43,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:43,977 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-11-28 02:34:43,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:34:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-11-28 02:34:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:34:43,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:43,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:43,979 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1394335238, now seen corresponding path program 1 times [2019-11-28 02:34:43,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:43,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126510711] [2019-11-28 02:34:43,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:44,198 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:34:44,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126510711] [2019-11-28 02:34:44,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:44,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:34:44,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361400349] [2019-11-28 02:34:44,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:34:44,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:34:44,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:34:44,201 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 9 states. [2019-11-28 02:34:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:44,562 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-11-28 02:34:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:34:44,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-11-28 02:34:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:44,564 INFO L225 Difference]: With dead ends: 51 [2019-11-28 02:34:44,564 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 02:34:44,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:34:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 02:34:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-11-28 02:34:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:34:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-28 02:34:44,571 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2019-11-28 02:34:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:44,571 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-28 02:34:44,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:34:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-28 02:34:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:34:44,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:44,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:44,572 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1394335237, now seen corresponding path program 1 times [2019-11-28 02:34:44,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:44,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052639296] [2019-11-28 02:34:44,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:44,711 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:34:44,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052639296] [2019-11-28 02:34:44,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:44,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:34:44,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253788053] [2019-11-28 02:34:44,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:34:44,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:34:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:34:44,714 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 11 states. [2019-11-28 02:34:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:45,084 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-11-28 02:34:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:34:45,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-28 02:34:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:45,088 INFO L225 Difference]: With dead ends: 44 [2019-11-28 02:34:45,088 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 02:34:45,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:34:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 02:34:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-28 02:34:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:34:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-11-28 02:34:45,094 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2019-11-28 02:34:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:45,095 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-11-28 02:34:45,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:34:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-11-28 02:34:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:34:45,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:45,096 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:34:45,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:45,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1141317818, now seen corresponding path program 1 times [2019-11-28 02:34:45,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:45,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616691276] [2019-11-28 02:34:45,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:45,256 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:34:45,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616691276] [2019-11-28 02:34:45,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:45,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:34:45,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348965134] [2019-11-28 02:34:45,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:34:45,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:34:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:34:45,258 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2019-11-28 02:34:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:45,649 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-11-28 02:34:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:34:45,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 02:34:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:45,650 INFO L225 Difference]: With dead ends: 43 [2019-11-28 02:34:45,650 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 02:34:45,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:34:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 02:34:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 02:34:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:34:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-11-28 02:34:45,655 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2019-11-28 02:34:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:45,655 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-11-28 02:34:45,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:34:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-11-28 02:34:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:34:45,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:45,656 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, 1] [2019-11-28 02:34:45,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1021113922, now seen corresponding path program 1 times [2019-11-28 02:34:45,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:45,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349281257] [2019-11-28 02:34:45,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:45,882 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:34:45,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349281257] [2019-11-28 02:34:45,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:45,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:34:45,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025040873] [2019-11-28 02:34:45,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:34:45,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:34:45,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:34:45,884 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2019-11-28 02:34:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:46,311 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-11-28 02:34:46,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:34:46,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-28 02:34:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:46,313 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:34:46,313 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:34:46,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:34:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:34:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 02:34:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:34:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-11-28 02:34:46,318 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 22 [2019-11-28 02:34:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:46,319 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-11-28 02:34:46,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:34:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-11-28 02:34:46,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:34:46,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:46,320 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, 1, 1] [2019-11-28 02:34:46,320 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:46,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1589760440, now seen corresponding path program 1 times [2019-11-28 02:34:46,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:46,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638578952] [2019-11-28 02:34:46,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:46,495 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:34:46,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638578952] [2019-11-28 02:34:46,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:46,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:34:46,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598609530] [2019-11-28 02:34:46,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:34:46,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:34:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:34:46,498 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2019-11-28 02:34:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:46,858 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-11-28 02:34:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:34:46,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 02:34:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:46,860 INFO L225 Difference]: With dead ends: 41 [2019-11-28 02:34:46,860 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 02:34:46,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:34:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 02:34:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-28 02:34:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 02:34:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-11-28 02:34:46,864 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2019-11-28 02:34:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:46,865 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-11-28 02:34:46,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:34:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-11-28 02:34:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:34:46,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:46,866 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, 1, 1, 1] [2019-11-28 02:34:46,866 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2037933312, now seen corresponding path program 1 times [2019-11-28 02:34:46,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:46,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282224393] [2019-11-28 02:34:46,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:46,919 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:34:46,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282224393] [2019-11-28 02:34:46,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:46,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:34:46,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582527314] [2019-11-28 02:34:46,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:34:46,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:34:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:34:46,921 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 6 states. [2019-11-28 02:34:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:47,062 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-11-28 02:34:47,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:34:47,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 02:34:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:47,063 INFO L225 Difference]: With dead ends: 40 [2019-11-28 02:34:47,063 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:34:47,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:34:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:34:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 02:34:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 02:34:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-11-28 02:34:47,070 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 24 [2019-11-28 02:34:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:47,071 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-11-28 02:34:47,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:34:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-11-28 02:34:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:34:47,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:47,072 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, 1, 1, 1, 1] [2019-11-28 02:34:47,072 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:47,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1248576842, now seen corresponding path program 1 times [2019-11-28 02:34:47,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:47,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542391455] [2019-11-28 02:34:47,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:47,168 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:34:47,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542391455] [2019-11-28 02:34:47,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:47,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:34:47,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942540592] [2019-11-28 02:34:47,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:34:47,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:34:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:34:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:34:47,171 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 7 states. [2019-11-28 02:34:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:47,298 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-28 02:34:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:34:47,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 02:34:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:47,299 INFO L225 Difference]: With dead ends: 39 [2019-11-28 02:34:47,299 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 02:34:47,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:34:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 02:34:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 02:34:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 02:34:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-11-28 02:34:47,303 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2019-11-28 02:34:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:47,303 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-11-28 02:34:47,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:34:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-11-28 02:34:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:34:47,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:47,304 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, 1, 1, 1, 1, 1] [2019-11-28 02:34:47,305 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash 6486715, now seen corresponding path program 1 times [2019-11-28 02:34:47,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:34:47,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740085697] [2019-11-28 02:34:47,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:34:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:34:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:34:47,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:34:47,363 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:34:47,383 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 02:34:47,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:34:47 BoogieIcfgContainer [2019-11-28 02:34:47,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:34:47,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:34:47,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:34:47,405 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:34:47,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:34:42" (3/4) ... [2019-11-28 02:34:47,410 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:34:47,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:34:47,415 INFO L168 Benchmark]: Toolchain (without parser) took 6480.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 957.7 MB in the beginning and 873.3 MB in the end (delta: 84.4 MB). Peak memory consumption was 298.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:47,416 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:34:47,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:47,422 INFO L168 Benchmark]: Boogie Preprocessor took 62.21 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:47,424 INFO L168 Benchmark]: RCFGBuilder took 776.75 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:47,425 INFO L168 Benchmark]: TraceAbstraction took 5110.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 873.3 MB in the end (delta: 195.6 MB). Peak memory consumption was 266.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:47,426 INFO L168 Benchmark]: Witness Printer took 6.87 ms. Allocated memory is still 1.2 GB. Free memory is still 873.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:34:47,441 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 517.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.21 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 776.75 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5110.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 873.3 MB in the end (delta: 195.6 MB). Peak memory consumption was 266.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.87 ms. Allocated memory is still 1.2 GB. Free memory is still 873.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 532. Possible FailurePath: [L533] TData data; VAL [data={2:0}] [L534] CALL alloc_data(&data) VAL [pdata={2:0}] [L518] pdata->lo = malloc(16) VAL [malloc(16)={-2:0}, pdata={2:0}, pdata={2:0}] [L519] pdata->hi = malloc(24) VAL [malloc(16)={-2:0}, malloc(24)={-1:0}, pdata={2:0}, pdata={2:0}] [L534] RET alloc_data(&data) VAL [data={2:0}] [L535] CALL free_data(&data) VAL [data={2:0}] [L523] EXPR data->lo VAL [data={2:0}, data={2:0}, data->lo={-2:0}] [L523] void *lo = data->lo; [L524] EXPR data->hi VAL [data={2:0}, data={2:0}, data->hi={-1:0}, lo={-2:0}] [L524] void *hi = data->hi; [L525] COND FALSE !(lo == hi) VAL [data={2:0}, data={2:0}, hi={-1:0}, lo={-2:0}] [L529] data->lo = (void *) 0 VAL [data={2:0}, data={2:0}, hi={-1:0}, lo={-2:0}] [L530] data->hi = (void *) 0 VAL [data={2:0}, data={2:0}, hi={-1:0}, lo={-2:0}] [L535] RET free_data(&data) VAL [data={2:0}] [L536] return 0; [L536] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 69 locations, 19 error locations. Result: UNSAFE, OverallTime: 4.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 245 SDtfs, 506 SDslu, 537 SDs, 0 SdLazy, 1653 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 15077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:34:49,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:34:49,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:34:49,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:34:49,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:34:49,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:34:49,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:34:49,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:34:49,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:34:49,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:34:49,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:34:49,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:34:49,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:34:49,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:34:49,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:34:49,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:34:49,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:34:49,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:34:49,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:34:49,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:34:49,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:34:49,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:34:49,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:34:49,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:34:49,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:34:49,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:34:49,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:34:49,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:34:49,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:34:49,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:34:49,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:34:49,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:34:49,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:34:49,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:34:49,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:34:49,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:34:49,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:34:49,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:34:49,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:34:49,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:34:49,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:34:49,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 02:34:49,454 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:34:49,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:34:49,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:34:49,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:34:49,456 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:34:49,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:34:49,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:34:49,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:34:49,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:34:49,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:34:49,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:34:49,458 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:34:49,458 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:34:49,459 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:34:49,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:34:49,459 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:34:49,459 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 02:34:49,460 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 02:34:49,460 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:34:49,460 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:34:49,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:34:49,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:34:49,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:34:49,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:34:49,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:34:49,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:34:49,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:34:49,463 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 02:34:49,463 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 02:34:49,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 02:34:49,464 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a9fb1ca01555f439b860fec974f930b68e3dc780 [2019-11-28 02:34:49,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:34:49,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:34:49,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:34:49,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:34:49,794 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:34:49,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 02:34:49,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306bd9873/4b8b1911baf44673a478273d9e9cdc4f/FLAG122e93f06 [2019-11-28 02:34:50,430 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:34:50,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 02:34:50,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306bd9873/4b8b1911baf44673a478273d9e9cdc4f/FLAG122e93f06 [2019-11-28 02:34:50,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306bd9873/4b8b1911baf44673a478273d9e9cdc4f [2019-11-28 02:34:50,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:34:50,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:34:50,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:34:50,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:34:50,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:34:50,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:34:50" (1/1) ... [2019-11-28 02:34:50,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:50, skipping insertion in model container [2019-11-28 02:34:50,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:34:50" (1/1) ... [2019-11-28 02:34:50,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:34:50,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:34:51,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:34:51,157 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:34:51,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:34:51,290 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:34:51,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51 WrapperNode [2019-11-28 02:34:51,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:34:51,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:34:51,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:34:51,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:34:51,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (1/1) ... [2019-11-28 02:34:51,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (1/1) ... [2019-11-28 02:34:51,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (1/1) ... [2019-11-28 02:34:51,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (1/1) ... [2019-11-28 02:34:51,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (1/1) ... [2019-11-28 02:34:51,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (1/1) ... [2019-11-28 02:34:51,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (1/1) ... [2019-11-28 02:34:51,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:34:51,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:34:51,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:34:51,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:34:51,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (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:34:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:34:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:34:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 02:34:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:34:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:34:51,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 02:34:51,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 02:34:51,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 02:34:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-28 02:34:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-28 02:34:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:34:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:34:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:34:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:34:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:34:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:34:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:34:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:34:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:34:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:34:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:34:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:34:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:34:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:34:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:34:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:34:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:34:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:34:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:34:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:34:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:34:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:34:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:34:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:34:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:34:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:34:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:34:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:34:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:34:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:34:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:34:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:34:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:34:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:34:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:34:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:34:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:34:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:34:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:34:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:34:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:34:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:34:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:34:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:34:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:34:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:34:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:34:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:34:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:34:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:34:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:34:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:34:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:34:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:34:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:34:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:34:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:34:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:34:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:34:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:34:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:34:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:34:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:34:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:34:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-28 02:34:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:34:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 02:34:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-28 02:34:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 02:34:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:34:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:34:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:34:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:34:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:34:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 02:34:52,064 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:34:52,064 INFO L297 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 02:34:52,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:34:52 BoogieIcfgContainer [2019-11-28 02:34:52,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:34:52,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:34:52,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:34:52,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:34:52,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:34:50" (1/3) ... [2019-11-28 02:34:52,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353acba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:34:52, skipping insertion in model container [2019-11-28 02:34:52,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:34:51" (2/3) ... [2019-11-28 02:34:52,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353acba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:34:52, skipping insertion in model container [2019-11-28 02:34:52,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:34:52" (3/3) ... [2019-11-28 02:34:52,073 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2019-11-28 02:34:52,082 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:34:52,090 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-28 02:34:52,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-28 02:34:52,122 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:34:52,122 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:34:52,122 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:34:52,123 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:34:52,123 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:34:52,123 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:34:52,123 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:34:52,123 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:34:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-11-28 02:34:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:34:52,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:52,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:52,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:52,158 INFO L82 PathProgramCache]: Analyzing trace with hash 259421077, now seen corresponding path program 1 times [2019-11-28 02:34:52,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:34:52,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247443993] [2019-11-28 02:34:52,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 02:34:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:52,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:34:52,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:34:52,396 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:34:52,397 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:52,407 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:52,407 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:34:52,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 02:34:52,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:52,464 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 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-28 02:34:52,467 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:52,489 INFO L588 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-28 02:34:52,491 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:34:52,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-28 02:34:52,512 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:34:52,512 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:34:52,551 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:34:52,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247443993] [2019-11-28 02:34:52,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:52,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 02:34:52,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818035547] [2019-11-28 02:34:52,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:34:52,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:34:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:34:52,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:34:52,577 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2019-11-28 02:34:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:52,758 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-11-28 02:34:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:34:52,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 02:34:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:52,767 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:34:52,767 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 02:34:52,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:34:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 02:34:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 02:34:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:34:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-28 02:34:52,802 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-11-28 02:34:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:52,803 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-28 02:34:52,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:34:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-28 02:34:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:34:52,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:52,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:53,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 02:34:53,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 259421078, now seen corresponding path program 1 times [2019-11-28 02:34:53,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:34:53,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381557909] [2019-11-28 02:34:53,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 02:34:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:53,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:34:53,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:34:53,154 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:34:53,154 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:53,165 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:53,170 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:34:53,170 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:53,180 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:53,182 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:34:53,182 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 02:34:53,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:53,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 02:34:53,258 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:53,274 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:53,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-28 02:34:53,282 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:53,304 INFO L588 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-28 02:34:53,306 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:34:53,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-28 02:34:53,331 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:34:53,331 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:34:53,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:53,604 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:34:53,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381557909] [2019-11-28 02:34:53,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:53,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-28 02:34:53,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385148182] [2019-11-28 02:34:53,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:34:53,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:34:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:34:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:34:53,608 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 8 states. [2019-11-28 02:34:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:54,271 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-11-28 02:34:54,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:34:54,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-28 02:34:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:54,275 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:34:54,275 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:34:54,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:34:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:34:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 02:34:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:34:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-28 02:34:54,283 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-11-28 02:34:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:54,283 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-28 02:34:54,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:34:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-28 02:34:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:34:54,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:54,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:54,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 02:34:54,494 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:54,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash 195552151, now seen corresponding path program 1 times [2019-11-28 02:34:54,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:34:54,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895149588] [2019-11-28 02:34:54,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 02:34:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:54,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 02:34:54,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:34:54,616 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:34:54,617 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:54,628 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:54,633 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:34:54,634 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:54,645 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:54,645 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:34:54,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 02:34:54,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:34:54,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-28 02:34:54,709 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:54,722 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:54,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:34:54,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 02:34:54,742 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:54,752 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:54,753 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:34:54,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-28 02:34:54,802 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_55|], 3=[|v_#length_31|]} [2019-11-28 02:34:54,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:54,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 02:34:54,818 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:54,832 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:54,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:54,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-28 02:34:54,879 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:54,913 INFO L588 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-11-28 02:34:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:54,916 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:34:54,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:23 [2019-11-28 02:34:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:54,945 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:34:54,945 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:34:54,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:55,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:55,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 02:34:55,126 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:55,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:55,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 02:34:55,149 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:34:55,172 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:55,174 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-28 02:34:55,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2019-11-28 02:34:55,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:55,458 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:34:55,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895149588] [2019-11-28 02:34:55,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:34:55,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-28 02:34:55,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534088750] [2019-11-28 02:34:55,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:34:55,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 02:34:55,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:34:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:34:55,461 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2019-11-28 02:34:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:34:56,085 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-11-28 02:34:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:34:56,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-11-28 02:34:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:34:56,087 INFO L225 Difference]: With dead ends: 47 [2019-11-28 02:34:56,087 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 02:34:56,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:34:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 02:34:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 02:34:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 02:34:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-11-28 02:34:56,094 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-11-28 02:34:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:34:56,094 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-11-28 02:34:56,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:34:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-11-28 02:34:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:34:56,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:34:56,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:34:56,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 02:34:56,313 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 02:34:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:34:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2119895045, now seen corresponding path program 1 times [2019-11-28 02:34:56,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 02:34:56,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982219979] [2019-11-28 02:34:56,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 02:34:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:34:56,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:34:56,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:34:56,524 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:34:56,525 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 02:34:56,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:56,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-28 02:34:56,823 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:34:56,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-28 02:34:56,833 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:34:56,868 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:56,869 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 02:34:56,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-11-28 02:34:57,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:57,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-28 02:34:57,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:57,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:57,190 INFO L508 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:34:57,249 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:34:57,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:34:57,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 02:34:57,453 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (exists ((v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (bvadd |alloc_data_#in~pdata.offset| (_ bv4 32)))) (or (not (bvule (bvadd alloc_data_~pdata.offset (_ bv8 32)) v_arrayElimCell_19)) (and (not (= v_arrayElimCell_19 v_arrayElimCell_18)) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base)) (and (not (bvule .cse0 v_arrayElimCell_17)) (bvule (bvadd |alloc_data_#in~pdata.offset| (_ bv8 32)) v_arrayElimCell_17)) (not (bvule |alloc_data_#in~pdata.offset| .cse0)) (bvule .cse0 v_arrayElimCell_18))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:505) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 02:34:57,461 INFO L168 Benchmark]: Toolchain (without parser) took 6780.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:57,461 INFO L168 Benchmark]: CDTParser took 0.28 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:34:57,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:57,463 INFO L168 Benchmark]: Boogie Preprocessor took 65.75 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:57,464 INFO L168 Benchmark]: RCFGBuilder took 707.69 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:57,465 INFO L168 Benchmark]: TraceAbstraction took 5392.20 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 1.1 GB in the end (delta: -57.4 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:34:57,475 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.28 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 608.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.75 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 707.69 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5392.20 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 1.1 GB in the end (delta: -57.4 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (exists ((v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (bvadd |alloc_data_#in~pdata.offset| (_ bv4 32)))) (or (not (bvule (bvadd alloc_data_~pdata.offset (_ bv8 32)) v_arrayElimCell_19)) (and (not (= v_arrayElimCell_19 v_arrayElimCell_18)) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base)) (and (not (bvule .cse0 v_arrayElimCell_17)) (bvule (bvadd |alloc_data_#in~pdata.offset| (_ bv8 32)) v_arrayElimCell_17)) (not (bvule |alloc_data_#in~pdata.offset| .cse0)) (bvule .cse0 v_arrayElimCell_18))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (exists ((v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (bvadd |alloc_data_#in~pdata.offset| (_ bv4 32)))) (or (not (bvule (bvadd alloc_data_~pdata.offset (_ bv8 32)) v_arrayElimCell_19)) (and (not (= v_arrayElimCell_19 v_arrayElimCell_18)) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base)) (and (not (bvule .cse0 v_arrayElimCell_17)) (bvule (bvadd |alloc_data_#in~pdata.offset| (_ bv8 32)) v_arrayElimCell_17)) (not (bvule |alloc_data_#in~pdata.offset| .cse0)) (bvule .cse0 v_arrayElimCell_18))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...