./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f 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/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 14:29:06,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:29:06,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:29:06,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:29:06,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:29:06,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:29:06,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:29:06,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:29:06,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:29:06,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:29:06,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:29:06,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:29:06,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:29:06,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:29:06,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:29:06,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:29:06,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:29:06,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:29:06,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:29:06,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:29:06,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:29:06,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:29:06,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:29:06,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:29:06,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:29:06,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:29:06,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:29:06,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:29:06,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:29:07,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:29:07,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:29:07,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:29:07,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:29:07,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:29:07,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:29:07,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:29:07,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:29:07,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:29:07,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:29:07,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:29:07,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:29:07,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-22 14:29:07,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:29:07,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:29:07,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:29:07,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:29:07,042 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:29:07,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:29:07,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:29:07,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:29:07,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:29:07,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:29:07,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:29:07,044 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:29:07,044 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:29:07,044 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:29:07,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:29:07,045 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:29:07,045 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:29:07,045 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:29:07,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:29:07,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:29:07,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:29:07,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:29:07,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:29:07,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:29:07,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:29:07,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:29:07,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:29:07,047 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 -> f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 [2019-11-22 14:29:07,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:29:07,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:29:07,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:29:07,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:29:07,354 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:29:07,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-22 14:29:07,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0495a4f/ff27ba873aa44c8896fa7596cf6ff52c/FLAGc6ac4c6e8 [2019-11-22 14:29:07,898 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:29:07,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-22 14:29:07,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0495a4f/ff27ba873aa44c8896fa7596cf6ff52c/FLAGc6ac4c6e8 [2019-11-22 14:29:08,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0495a4f/ff27ba873aa44c8896fa7596cf6ff52c [2019-11-22 14:29:08,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:29:08,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:29:08,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:29:08,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:29:08,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:29:08,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655be99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08, skipping insertion in model container [2019-11-22 14:29:08,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:29:08,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:29:08,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:29:08,572 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:29:08,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:29:08,660 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:29:08,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08 WrapperNode [2019-11-22 14:29:08,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:29:08,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:29:08,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:29:08,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:29:08,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (1/1) ... [2019-11-22 14:29:08,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:29:08,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:29:08,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:29:08,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:29:08,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (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-22 14:29:08,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:29:08,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:29:08,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 14:29:08,750 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-22 14:29:08,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:29:08,750 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 14:29:08,750 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:29:08,750 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:29:08,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:29:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 14:29:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 14:29:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:29:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-22 14:29:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 14:29:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:29:08,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:29:08,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 14:29:08,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:29:08,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:29:08,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:29:08,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 14:29:09,121 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:29:09,122 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-22 14:29:09,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:09 BoogieIcfgContainer [2019-11-22 14:29:09,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:29:09,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:29:09,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:29:09,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:29:09,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:29:08" (1/3) ... [2019-11-22 14:29:09,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af86267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:29:09, skipping insertion in model container [2019-11-22 14:29:09,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:08" (2/3) ... [2019-11-22 14:29:09,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af86267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:29:09, skipping insertion in model container [2019-11-22 14:29:09,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:09" (3/3) ... [2019-11-22 14:29:09,130 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2019-11-22 14:29:09,139 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:29:09,146 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-22 14:29:09,156 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-22 14:29:09,174 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:29:09,174 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:29:09,174 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:29:09,175 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:29:09,175 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:29:09,175 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:29:09,175 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:29:09,175 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:29:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-22 14:29:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:29:09,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:09,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:29:09,203 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957205, now seen corresponding path program 1 times [2019-11-22 14:29:09,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:09,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928682757] [2019-11-22 14:29:09,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:09,506 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-22 14:29:09,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928682757] [2019-11-22 14:29:09,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:09,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:29:09,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431369157] [2019-11-22 14:29:09,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:29:09,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:29:09,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:29:09,535 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2019-11-22 14:29:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:09,874 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-22 14:29:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:29:09,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-22 14:29:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:09,886 INFO L225 Difference]: With dead ends: 59 [2019-11-22 14:29:09,886 INFO L226 Difference]: Without dead ends: 56 [2019-11-22 14:29:09,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:29:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-22 14:29:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-22 14:29:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-22 14:29:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-22 14:29:09,933 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 18 [2019-11-22 14:29:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:09,935 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-22 14:29:09,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:29:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-22 14:29:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:29:09,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:09,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:29:09,938 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957204, now seen corresponding path program 1 times [2019-11-22 14:29:09,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:09,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354509109] [2019-11-22 14:29:09,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,171 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-22 14:29:10,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354509109] [2019-11-22 14:29:10,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:10,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:29:10,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277070383] [2019-11-22 14:29:10,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:29:10,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:29:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:29:10,175 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2019-11-22 14:29:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:10,464 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-22 14:29:10,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:29:10,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-22 14:29:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:10,467 INFO L225 Difference]: With dead ends: 54 [2019-11-22 14:29:10,467 INFO L226 Difference]: Without dead ends: 54 [2019-11-22 14:29:10,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:29:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-22 14:29:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-22 14:29:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 14:29:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-22 14:29:10,477 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 18 [2019-11-22 14:29:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:10,477 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-22 14:29:10,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:29:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-22 14:29:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 14:29:10,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:10,479 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] [2019-11-22 14:29:10,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2036436141, now seen corresponding path program 1 times [2019-11-22 14:29:10,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:10,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554067638] [2019-11-22 14:29:10,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:10,734 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-22 14:29:10,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554067638] [2019-11-22 14:29:10,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:10,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 14:29:10,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813805452] [2019-11-22 14:29:10,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 14:29:10,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 14:29:10,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:29:10,743 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2019-11-22 14:29:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:11,319 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-11-22 14:29:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 14:29:11,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-22 14:29:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:11,323 INFO L225 Difference]: With dead ends: 82 [2019-11-22 14:29:11,323 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 14:29:11,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-22 14:29:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 14:29:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-22 14:29:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 14:29:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-22 14:29:11,343 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 20 [2019-11-22 14:29:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:11,350 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-22 14:29:11,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 14:29:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-22 14:29:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:29:11,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:11,351 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-22 14:29:11,352 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818779, now seen corresponding path program 1 times [2019-11-22 14:29:11,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:11,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339859996] [2019-11-22 14:29:11,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:11,446 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-22 14:29:11,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339859996] [2019-11-22 14:29:11,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:11,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:29:11,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864383125] [2019-11-22 14:29:11,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:29:11,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:29:11,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:29:11,449 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2019-11-22 14:29:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:11,737 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-22 14:29:11,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 14:29:11,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 14:29:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:11,739 INFO L225 Difference]: With dead ends: 56 [2019-11-22 14:29:11,740 INFO L226 Difference]: Without dead ends: 56 [2019-11-22 14:29:11,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:29:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-22 14:29:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-22 14:29:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-22 14:29:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-11-22 14:29:11,758 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 21 [2019-11-22 14:29:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:11,761 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-11-22 14:29:11,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:29:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-11-22 14:29:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:29:11,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:11,763 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-22 14:29:11,763 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818778, now seen corresponding path program 1 times [2019-11-22 14:29:11,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:11,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724466798] [2019-11-22 14:29:11,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:12,019 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-22 14:29:12,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724466798] [2019-11-22 14:29:12,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:12,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 14:29:12,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833445198] [2019-11-22 14:29:12,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:29:12,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:29:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:29:12,022 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2019-11-22 14:29:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:12,735 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-22 14:29:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:29:12,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-22 14:29:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:12,737 INFO L225 Difference]: With dead ends: 90 [2019-11-22 14:29:12,737 INFO L226 Difference]: Without dead ends: 90 [2019-11-22 14:29:12,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:29:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-22 14:29:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2019-11-22 14:29:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-22 14:29:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-22 14:29:12,748 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 21 [2019-11-22 14:29:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:12,748 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-22 14:29:12,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:29:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-11-22 14:29:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:29:12,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:12,750 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-22 14:29:12,750 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:12,751 INFO L82 PathProgramCache]: Analyzing trace with hash -486807298, now seen corresponding path program 1 times [2019-11-22 14:29:12,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:12,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969366262] [2019-11-22 14:29:12,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:12,937 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-22 14:29:12,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969366262] [2019-11-22 14:29:12,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:12,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 14:29:12,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969116459] [2019-11-22 14:29:12,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:29:12,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:29:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:29:12,945 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 10 states. [2019-11-22 14:29:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:13,515 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-22 14:29:13,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:29:13,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 14:29:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:13,518 INFO L225 Difference]: With dead ends: 87 [2019-11-22 14:29:13,518 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 14:29:13,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:29:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 14:29:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2019-11-22 14:29:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-22 14:29:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-22 14:29:13,527 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 22 [2019-11-22 14:29:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:13,527 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-22 14:29:13,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:29:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-22 14:29:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-22 14:29:13,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:13,529 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, 1, 1] [2019-11-22 14:29:13,529 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1532204726, now seen corresponding path program 1 times [2019-11-22 14:29:13,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:13,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012897437] [2019-11-22 14:29:13,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,593 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-22 14:29:13,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012897437] [2019-11-22 14:29:13,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:13,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:29:13,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833662978] [2019-11-22 14:29:13,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:29:13,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:13,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:29:13,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:29:13,596 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2019-11-22 14:29:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:13,745 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-11-22 14:29:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:29:13,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-22 14:29:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:13,748 INFO L225 Difference]: With dead ends: 73 [2019-11-22 14:29:13,748 INFO L226 Difference]: Without dead ends: 73 [2019-11-22 14:29:13,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:29:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-22 14:29:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-22 14:29:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-22 14:29:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-11-22 14:29:13,757 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 28 [2019-11-22 14:29:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:13,757 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-11-22 14:29:13,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:29:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-11-22 14:29:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 14:29:13,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:13,759 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1] [2019-11-22 14:29:13,759 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:13,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1010784573, now seen corresponding path program 1 times [2019-11-22 14:29:13,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:13,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304745119] [2019-11-22 14:29:13,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:13,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304745119] [2019-11-22 14:29:13,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705643009] [2019-11-22 14:29:13,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:13,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:29:13,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:14,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:14,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-22 14:29:14,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244855553] [2019-11-22 14:29:14,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 14:29:14,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 14:29:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:29:14,296 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 17 states. [2019-11-22 14:29:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:17,741 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2019-11-22 14:29:17,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 14:29:17,742 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-22 14:29:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:17,744 INFO L225 Difference]: With dead ends: 135 [2019-11-22 14:29:17,744 INFO L226 Difference]: Without dead ends: 135 [2019-11-22 14:29:17,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-11-22 14:29:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-22 14:29:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2019-11-22 14:29:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-22 14:29:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2019-11-22 14:29:17,757 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 30 [2019-11-22 14:29:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:17,758 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2019-11-22 14:29:17,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 14:29:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2019-11-22 14:29:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 14:29:17,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:17,759 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, 1, 1, 1, 1] [2019-11-22 14:29:17,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:17,962 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -725039271, now seen corresponding path program 1 times [2019-11-22 14:29:17,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:17,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950212811] [2019-11-22 14:29:17,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,085 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-22 14:29:18,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950212811] [2019-11-22 14:29:18,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:18,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:29:18,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373188532] [2019-11-22 14:29:18,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:29:18,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:18,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:29:18,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:29:18,089 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 7 states. [2019-11-22 14:29:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:18,294 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2019-11-22 14:29:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:29:18,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-22 14:29:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:18,299 INFO L225 Difference]: With dead ends: 108 [2019-11-22 14:29:18,299 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 14:29:18,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:29:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 14:29:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-22 14:29:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-22 14:29:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2019-11-22 14:29:18,312 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 30 [2019-11-22 14:29:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:18,312 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2019-11-22 14:29:18,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:29:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2019-11-22 14:29:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 14:29:18,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:18,314 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2019-11-22 14:29:18,314 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash -701366204, now seen corresponding path program 1 times [2019-11-22 14:29:18,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:18,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588773393] [2019-11-22 14:29:18,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:18,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588773393] [2019-11-22 14:29:18,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507492877] [2019-11-22 14:29:18,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:18,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 14:29:18,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:19,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:19,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-22 14:29:19,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799930404] [2019-11-22 14:29:19,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 14:29:19,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:19,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 14:29:19,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-22 14:29:19,032 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 27 states. [2019-11-22 14:29:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:21,937 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-11-22 14:29:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-22 14:29:21,937 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-22 14:29:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:21,941 INFO L225 Difference]: With dead ends: 187 [2019-11-22 14:29:21,941 INFO L226 Difference]: Without dead ends: 187 [2019-11-22 14:29:21,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=475, Invalid=2495, Unknown=0, NotChecked=0, Total=2970 [2019-11-22 14:29:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-22 14:29:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-11-22 14:29:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-22 14:29:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-11-22 14:29:21,957 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 32 [2019-11-22 14:29:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:21,957 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-22 14:29:21,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 14:29:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2019-11-22 14:29:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 14:29:21,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:21,959 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:29:22,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:22,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash -997384011, now seen corresponding path program 1 times [2019-11-22 14:29:22,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:22,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093227171] [2019-11-22 14:29:22,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 14:29:22,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093227171] [2019-11-22 14:29:22,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850193674] [2019-11-22 14:29:22,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:22,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:29:22,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:22,447 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 8 treesize of output 7 [2019-11-22 14:29:22,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:22,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:22,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:29:22,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:29:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:22,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:22,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 14:29:22,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570498345] [2019-11-22 14:29:22,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 14:29:22,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:22,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 14:29:22,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:29:22,876 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand 21 states. [2019-11-22 14:29:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:24,803 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2019-11-22 14:29:24,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 14:29:24,804 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-22 14:29:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:24,807 INFO L225 Difference]: With dead ends: 210 [2019-11-22 14:29:24,807 INFO L226 Difference]: Without dead ends: 210 [2019-11-22 14:29:24,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2019-11-22 14:29:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-22 14:29:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 147. [2019-11-22 14:29:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-22 14:29:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2019-11-22 14:29:24,819 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 33 [2019-11-22 14:29:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:24,820 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2019-11-22 14:29:24,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 14:29:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2019-11-22 14:29:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 14:29:24,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:24,821 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2019-11-22 14:29:25,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:25,028 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1094393214, now seen corresponding path program 1 times [2019-11-22 14:29:25,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:25,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062436326] [2019-11-22 14:29:25,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:25,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062436326] [2019-11-22 14:29:25,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427395317] [2019-11-22 14:29:25,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:25,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:29:25,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:25,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2019-11-22 14:29:25,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:25,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:25,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:29:25,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-22 14:29:27,458 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-11-22 14:29:27,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 23 [2019-11-22 14:29:27,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:27,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:27,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:29:27,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-22 14:29:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:27,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:29:27,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-22 14:29:27,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554099225] [2019-11-22 14:29:27,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:29:27,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:29:27,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-22 14:29:27,600 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 10 states. [2019-11-22 14:29:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:27,785 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-22 14:29:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:29:27,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-22 14:29:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:27,786 INFO L225 Difference]: With dead ends: 85 [2019-11-22 14:29:27,786 INFO L226 Difference]: Without dead ends: 85 [2019-11-22 14:29:27,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2019-11-22 14:29:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-22 14:29:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-22 14:29:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-22 14:29:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-22 14:29:27,794 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 32 [2019-11-22 14:29:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:27,795 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-22 14:29:27,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:29:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-22 14:29:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 14:29:27,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:27,803 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:29:28,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:28,008 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash -854133297, now seen corresponding path program 1 times [2019-11-22 14:29:28,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:28,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544467111] [2019-11-22 14:29:28,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 14:29:28,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544467111] [2019-11-22 14:29:28,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063022282] [2019-11-22 14:29:28,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:28,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:29:28,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:28,266 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 8 treesize of output 7 [2019-11-22 14:29:28,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:28,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:28,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:29:28,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:29:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:28,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:28,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 14:29:28,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39653815] [2019-11-22 14:29:28,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 14:29:28,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 14:29:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:29:28,715 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2019-11-22 14:29:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:30,121 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-11-22 14:29:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 14:29:30,122 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-22 14:29:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:30,123 INFO L225 Difference]: With dead ends: 93 [2019-11-22 14:29:30,124 INFO L226 Difference]: Without dead ends: 93 [2019-11-22 14:29:30,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 14:29:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-22 14:29:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-22 14:29:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-22 14:29:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-22 14:29:30,130 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2019-11-22 14:29:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:30,130 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-22 14:29:30,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 14:29:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-22 14:29:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 14:29:30,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:30,132 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:29:30,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:30,336 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1410938279, now seen corresponding path program 1 times [2019-11-22 14:29:30,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:30,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128908042] [2019-11-22 14:29:30,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 14:29:30,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128908042] [2019-11-22 14:29:30,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717105656] [2019-11-22 14:29:30,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:30,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-22 14:29:30,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:30,888 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 8 treesize of output 7 [2019-11-22 14:29:30,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:30,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:30,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:29:30,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:29:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 14:29:31,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:31,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2019-11-22 14:29:31,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234312709] [2019-11-22 14:29:31,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 14:29:31,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:31,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 14:29:31,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-11-22 14:29:31,533 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 32 states. [2019-11-22 14:29:33,169 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-22 14:29:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:33,914 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-11-22 14:29:33,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-22 14:29:33,914 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-11-22 14:29:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:33,915 INFO L225 Difference]: With dead ends: 91 [2019-11-22 14:29:33,915 INFO L226 Difference]: Without dead ends: 67 [2019-11-22 14:29:33,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2019-11-22 14:29:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-22 14:29:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-11-22 14:29:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 14:29:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-22 14:29:33,921 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 45 [2019-11-22 14:29:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:33,921 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-22 14:29:33,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 14:29:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-22 14:29:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-22 14:29:33,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:33,923 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:29:34,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:34,126 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 14:29:34,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1674201326, now seen corresponding path program 1 times [2019-11-22 14:29:34,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:34,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127531585] [2019-11-22 14:29:34,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-22 14:29:34,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127531585] [2019-11-22 14:29:34,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924062885] [2019-11-22 14:29:34,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:34,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-22 14:29:34,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:29:34,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:34,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-22 14:29:34,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902243827] [2019-11-22 14:29:34,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 14:29:34,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 14:29:34,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-22 14:29:34,928 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-22 14:29:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:37,283 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-22 14:29:37,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-22 14:29:37,283 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-22 14:29:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:37,284 INFO L225 Difference]: With dead ends: 66 [2019-11-22 14:29:37,284 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:29:37,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 14:29:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:29:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:29:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:29:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:29:37,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-22 14:29:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:37,286 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:29:37,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 14:29:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:29:37,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:29:37,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:37,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:29:37 BoogieIcfgContainer [2019-11-22 14:29:37,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:29:37,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:29:37,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:29:37,495 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:29:37,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:09" (3/4) ... [2019-11-22 14:29:37,498 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:29:37,504 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 14:29:37,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 14:29:37,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 14:29:37,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-22 14:29:37,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 14:29:37,512 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-22 14:29:37,513 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 14:29:37,513 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 14:29:37,514 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:29:37,566 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:29:37,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:29:37,569 INFO L168 Benchmark]: Toolchain (without parser) took 29251.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 244.0 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:37,569 INFO L168 Benchmark]: CDTParser took 0.41 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-22 14:29:37,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:37,571 INFO L168 Benchmark]: Boogie Preprocessor took 36.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:37,571 INFO L168 Benchmark]: RCFGBuilder took 424.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:37,572 INFO L168 Benchmark]: TraceAbstraction took 28369.57 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.7 MB). Peak memory consumption was 239.8 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:37,573 INFO L168 Benchmark]: Witness Printer took 72.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:29:37,575 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.41 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 343.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 424.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28369.57 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.7 MB). Peak memory consumption was 239.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 16 error locations. Result: SAFE, OverallTime: 28.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 511 SDtfs, 2284 SDslu, 1187 SDs, 0 SdLazy, 7256 SolverSat, 1128 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 291 SyntacticMatches, 14 SemanticMatches, 364 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 220 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 682 ConstructedInterpolants, 68 QuantifiedInterpolants, 185721 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1278 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 59/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...