./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.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/duplets.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 c261d11d6e37ef6eda45455c8074b5a0eac3352b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28:26,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:28:26,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:28:26,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:28:26,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:28:26,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:28:26,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:28:26,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:28:26,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:28:26,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:28:26,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:28:26,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:28:26,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:28:26,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:28:26,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:28:26,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:28:26,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:28:26,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:28:26,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:28:26,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:28:26,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:28:26,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:28:26,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:28:26,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:28:26,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:28:26,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:28:26,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:28:26,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:28:26,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:28:26,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:28:26,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:28:26,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:28:26,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:28:26,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:28:26,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:28:26,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:28:26,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:28:26,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:28:26,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:28:26,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:28:26,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:28:26,203 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:28:26,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:28:26,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:28:26,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:28:26,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:28:26,221 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:28:26,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:28:26,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:28:26,222 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:28:26,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:28:26,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:28:26,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:28:26,223 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:28:26,224 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:28:26,224 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:28:26,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:28:26,225 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:28:26,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:28:26,225 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:28:26,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:28:26,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:28:26,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:28:26,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:28:26,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:28:26,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:28:26,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:28:26,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:28:26,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:28:26,228 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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-22 14:28:26,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:28:26,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:28:26,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:28:26,559 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:28:26,560 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:28:26,560 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-22 14:28:26,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b991c329/abd44f29e9f045689c4edba09544d06c/FLAG7b3c12967 [2019-11-22 14:28:27,162 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:28:27,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-22 14:28:27,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b991c329/abd44f29e9f045689c4edba09544d06c/FLAG7b3c12967 [2019-11-22 14:28:27,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b991c329/abd44f29e9f045689c4edba09544d06c [2019-11-22 14:28:27,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:28:27,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:28:27,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:28:27,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:28:27,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:28:27,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7496d8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27, skipping insertion in model container [2019-11-22 14:28:27,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:28:27,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:28:27,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:28:27,825 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:28:27,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:28:27,926 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:28:27,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27 WrapperNode [2019-11-22 14:28:27,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:28:27,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:28:27,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:28:27,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:28:27,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... [2019-11-22 14:28:27,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:28:27,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:28:27,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:28:27,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:28:27,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:28:28,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:28:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:28:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 14:28:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-22 14:28:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-22 14:28:28,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:28:28,044 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 14:28:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:28:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:28:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:28:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 14:28:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:28:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 14:28:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-22 14:28:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 14:28:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-22 14:28:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 14:28:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:28:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:28:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 14:28:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 14:28:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:28:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:28:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:28:28,643 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:28:28,643 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-22 14:28:28,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:28 BoogieIcfgContainer [2019-11-22 14:28:28,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:28:28,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:28:28,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:28:28,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:28:28,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:28:27" (1/3) ... [2019-11-22 14:28:28,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8eafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:28:28, skipping insertion in model container [2019-11-22 14:28:28,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:27" (2/3) ... [2019-11-22 14:28:28,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8eafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:28:28, skipping insertion in model container [2019-11-22 14:28:28,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:28" (3/3) ... [2019-11-22 14:28:28,659 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-22 14:28:28,669 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:28:28,676 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-11-22 14:28:28,686 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-11-22 14:28:28,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:28:28,705 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:28:28,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:28:28,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:28:28,706 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:28:28,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:28:28,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:28:28,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:28:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-22 14:28:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 14:28:28,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:28,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:28,752 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-11-22 14:28:28,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:28,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785901636] [2019-11-22 14:28:28,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:29,104 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:28:29,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785901636] [2019-11-22 14:28:29,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:29,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:28:29,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087144724] [2019-11-22 14:28:29,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:28:29,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:29,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:28:29,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:28:29,135 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-11-22 14:28:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:29,970 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-22 14:28:29,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:28:29,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 14:28:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:29,993 INFO L225 Difference]: With dead ends: 103 [2019-11-22 14:28:29,994 INFO L226 Difference]: Without dead ends: 100 [2019-11-22 14:28:29,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:28:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-22 14:28:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-22 14:28:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:28:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-22 14:28:30,077 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-11-22 14:28:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:30,078 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-22 14:28:30,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:28:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-22 14:28:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 14:28:30,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:30,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:30,082 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-11-22 14:28:30,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:30,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4553540] [2019-11-22 14:28:30,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:30,305 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:28:30,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4553540] [2019-11-22 14:28:30,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:30,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:28:30,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861818501] [2019-11-22 14:28:30,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:28:30,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:28:30,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:28:30,310 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-22 14:28:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:30,950 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-22 14:28:30,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:28:30,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 14:28:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:30,953 INFO L225 Difference]: With dead ends: 99 [2019-11-22 14:28:30,953 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 14:28:30,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:28:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 14:28:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-22 14:28:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 14:28:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-22 14:28:30,966 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-22 14:28:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:30,966 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-22 14:28:30,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:28:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-22 14:28:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 14:28:30,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:30,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:30,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:30,969 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-11-22 14:28:30,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:30,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467668845] [2019-11-22 14:28:30,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:31,116 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:28:31,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467668845] [2019-11-22 14:28:31,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:31,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:28:31,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620740677] [2019-11-22 14:28:31,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:28:31,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:28:31,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:28:31,119 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-11-22 14:28:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:31,738 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-22 14:28:31,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:28:31,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-22 14:28:31,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:31,741 INFO L225 Difference]: With dead ends: 98 [2019-11-22 14:28:31,742 INFO L226 Difference]: Without dead ends: 98 [2019-11-22 14:28:31,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:28:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-22 14:28:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-22 14:28:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-22 14:28:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-22 14:28:31,753 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-11-22 14:28:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:31,753 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-22 14:28:31,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:28:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-22 14:28:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 14:28:31,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:31,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:31,755 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-11-22 14:28:31,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:31,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942506993] [2019-11-22 14:28:31,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:31,901 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:28:31,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942506993] [2019-11-22 14:28:31,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:31,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:28:31,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158368980] [2019-11-22 14:28:31,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:28:31,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:31,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:28:31,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:28:31,904 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-11-22 14:28:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:32,437 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-22 14:28:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:28:32,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-22 14:28:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:32,439 INFO L225 Difference]: With dead ends: 96 [2019-11-22 14:28:32,439 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 14:28:32,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:28:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 14:28:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-22 14:28:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 14:28:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-22 14:28:32,448 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-11-22 14:28:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:32,449 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-22 14:28:32,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:28:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-22 14:28:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 14:28:32,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:32,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:32,450 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:32,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-11-22 14:28:32,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:32,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283287015] [2019-11-22 14:28:32,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:32,679 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:28:32,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283287015] [2019-11-22 14:28:32,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:32,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 14:28:32,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106501571] [2019-11-22 14:28:32,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 14:28:32,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:32,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 14:28:32,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:28:32,683 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-11-22 14:28:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:33,701 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-11-22 14:28:33,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:28:33,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-22 14:28:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:33,704 INFO L225 Difference]: With dead ends: 116 [2019-11-22 14:28:33,704 INFO L226 Difference]: Without dead ends: 116 [2019-11-22 14:28:33,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-11-22 14:28:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-22 14:28:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-11-22 14:28:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:28:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-22 14:28:33,717 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-11-22 14:28:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:33,717 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-22 14:28:33,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 14:28:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-22 14:28:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 14:28:33,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:33,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:33,719 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:33,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-11-22 14:28:33,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:33,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649221966] [2019-11-22 14:28:33,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:33,943 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:28:33,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649221966] [2019-11-22 14:28:33,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:33,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-22 14:28:33,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096269195] [2019-11-22 14:28:33,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 14:28:33,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:33,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 14:28:33,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:28:33,945 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-11-22 14:28:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:34,870 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-11-22 14:28:34,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:28:34,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-22 14:28:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:34,873 INFO L225 Difference]: With dead ends: 99 [2019-11-22 14:28:34,873 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 14:28:34,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:28:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 14:28:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-22 14:28:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 14:28:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-22 14:28:34,882 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-11-22 14:28:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:34,882 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-22 14:28:34,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 14:28:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-22 14:28:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 14:28:34,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:34,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:34,884 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:34,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-11-22 14:28:34,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:34,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533244924] [2019-11-22 14:28:34,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:34,984 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:28:34,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533244924] [2019-11-22 14:28:34,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:34,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:28:34,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335996121] [2019-11-22 14:28:34,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:28:34,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:34,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:28:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:28:34,988 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-11-22 14:28:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:35,367 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-22 14:28:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:28:35,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-22 14:28:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:35,369 INFO L225 Difference]: With dead ends: 94 [2019-11-22 14:28:35,369 INFO L226 Difference]: Without dead ends: 94 [2019-11-22 14:28:35,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:28:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-22 14:28:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-22 14:28:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-22 14:28:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-22 14:28:35,377 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-11-22 14:28:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:35,377 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-22 14:28:35,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:28:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-22 14:28:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 14:28:35,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:35,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:35,379 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-11-22 14:28:35,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:35,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107721909] [2019-11-22 14:28:35,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,485 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:28:35,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107721909] [2019-11-22 14:28:35,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:35,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:28:35,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375704195] [2019-11-22 14:28:35,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:28:35,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:35,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:28:35,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:28:35,488 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-11-22 14:28:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:35,854 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-22 14:28:35,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:28:35,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-22 14:28:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:35,856 INFO L225 Difference]: With dead ends: 89 [2019-11-22 14:28:35,856 INFO L226 Difference]: Without dead ends: 89 [2019-11-22 14:28:35,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:28:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-22 14:28:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-22 14:28:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-22 14:28:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-22 14:28:35,864 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-11-22 14:28:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:35,865 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-22 14:28:35,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:28:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-22 14:28:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 14:28:35,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:35,867 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] [2019-11-22 14:28:35,867 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:35,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:35,868 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-11-22 14:28:35,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:35,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678193332] [2019-11-22 14:28:35,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:28:35,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678193332] [2019-11-22 14:28:35,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665224058] [2019-11-22 14:28:35,957 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:28:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 14:28:36,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:36,064 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:28:36,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:28:36,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-22 14:28:36,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203710404] [2019-11-22 14:28:36,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:28:36,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:36,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:28:36,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:28:36,068 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-11-22 14:28:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:36,132 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-11-22 14:28:36,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:28:36,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-22 14:28:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:36,134 INFO L225 Difference]: With dead ends: 112 [2019-11-22 14:28:36,134 INFO L226 Difference]: Without dead ends: 112 [2019-11-22 14:28:36,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:28:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-22 14:28:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-11-22 14:28:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-22 14:28:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-22 14:28:36,140 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-11-22 14:28:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:36,140 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-22 14:28:36,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:28:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-22 14:28:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-22 14:28:36,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:36,144 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] [2019-11-22 14:28:36,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:36,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-11-22 14:28:36,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:36,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38504246] [2019-11-22 14:28:36,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,431 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:28:36,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38504246] [2019-11-22 14:28:36,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:36,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:28:36,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662380927] [2019-11-22 14:28:36,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:28:36,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:36,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:28:36,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:28:36,433 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-11-22 14:28:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:36,751 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-22 14:28:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:28:36,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-22 14:28:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:36,752 INFO L225 Difference]: With dead ends: 88 [2019-11-22 14:28:36,752 INFO L226 Difference]: Without dead ends: 88 [2019-11-22 14:28:36,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:28:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-22 14:28:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-22 14:28:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-22 14:28:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-22 14:28:36,757 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-22 14:28:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:36,758 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-22 14:28:36,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:28:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-22 14:28:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-22 14:28:36,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:36,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] [2019-11-22 14:28:36,759 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:36,759 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-11-22 14:28:36,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:36,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21753521] [2019-11-22 14:28:36,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:36,852 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:28:36,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21753521] [2019-11-22 14:28:36,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:36,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:28:36,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691183799] [2019-11-22 14:28:36,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:28:36,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:28:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:28:36,856 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-11-22 14:28:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:37,147 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-22 14:28:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:28:37,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-22 14:28:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:37,148 INFO L225 Difference]: With dead ends: 83 [2019-11-22 14:28:37,149 INFO L226 Difference]: Without dead ends: 83 [2019-11-22 14:28:37,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:28:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-22 14:28:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-22 14:28:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-22 14:28:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-11-22 14:28:37,154 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-11-22 14:28:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:37,155 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-11-22 14:28:37,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:28:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-11-22 14:28:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-22 14:28:37,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:37,156 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-22 14:28:37,156 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-11-22 14:28:37,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:37,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261908149] [2019-11-22 14:28:37,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:28:37,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261908149] [2019-11-22 14:28:37,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153070545] [2019-11-22 14:28:37,235 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:28:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:37,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 14:28:37,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:28:37,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:28:37,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-22 14:28:37,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899745755] [2019-11-22 14:28:37,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 14:28:37,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 14:28:37,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:28:37,300 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-11-22 14:28:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:37,768 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-22 14:28:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 14:28:37,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-22 14:28:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:37,770 INFO L225 Difference]: With dead ends: 122 [2019-11-22 14:28:37,770 INFO L226 Difference]: Without dead ends: 122 [2019-11-22 14:28:37,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-22 14:28:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-22 14:28:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-11-22 14:28:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 14:28:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-11-22 14:28:37,775 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-11-22 14:28:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:37,775 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-11-22 14:28:37,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 14:28:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-11-22 14:28:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 14:28:37,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:37,777 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-22 14:28:37,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:37,983 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-11-22 14:28:37,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:37,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629850155] [2019-11-22 14:28:37,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:28:38,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629850155] [2019-11-22 14:28:38,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266765839] [2019-11-22 14:28:38,087 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:38,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 14:28:38,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 14:28:38,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 14:28:38,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:28:38,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:28:38,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-22 14:28:38,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000352508] [2019-11-22 14:28:38,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 14:28:38,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 14:28:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:28:38,308 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-11-22 14:28:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:39,539 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-22 14:28:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 14:28:39,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-22 14:28:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:39,543 INFO L225 Difference]: With dead ends: 123 [2019-11-22 14:28:39,543 INFO L226 Difference]: Without dead ends: 123 [2019-11-22 14:28:39,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-22 14:28:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-22 14:28:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-11-22 14:28:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-22 14:28:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-22 14:28:39,553 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-11-22 14:28:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:39,553 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-22 14:28:39,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 14:28:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-22 14:28:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-22 14:28:39,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:39,555 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:39,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:39,774 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:39,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:39,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-11-22 14:28:39,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:39,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521481078] [2019-11-22 14:28:39,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-22 14:28:39,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521481078] [2019-11-22 14:28:39,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102478131] [2019-11-22 14:28:39,869 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:28:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:39,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 14:28:39,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 14:28:40,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:28:40,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-22 14:28:40,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253329301] [2019-11-22 14:28:40,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:28:40,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:28:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:28:40,018 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-11-22 14:28:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:40,079 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-11-22 14:28:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:28:40,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-22 14:28:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:40,081 INFO L225 Difference]: With dead ends: 104 [2019-11-22 14:28:40,081 INFO L226 Difference]: Without dead ends: 101 [2019-11-22 14:28:40,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-22 14:28:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-22 14:28:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-11-22 14:28:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-22 14:28:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-22 14:28:40,085 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-11-22 14:28:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:40,085 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-22 14:28:40,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:28:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-22 14:28:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-22 14:28:40,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:40,086 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:40,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:40,292 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:40,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-11-22 14:28:40,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:40,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854416770] [2019-11-22 14:28:40,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-22 14:28:40,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854416770] [2019-11-22 14:28:40,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192417929] [2019-11-22 14:28:40,379 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:28:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 14:28:40,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 14:28:40,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:28:40,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-11-22 14:28:40,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973711616] [2019-11-22 14:28:40,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:28:40,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:40,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:28:40,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:28:40,474 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-11-22 14:28:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:40,524 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-22 14:28:40,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 14:28:40,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-22 14:28:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:40,526 INFO L225 Difference]: With dead ends: 86 [2019-11-22 14:28:40,526 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 14:28:40,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:28:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 14:28:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-22 14:28:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 14:28:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-22 14:28:40,535 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-11-22 14:28:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:40,536 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-22 14:28:40,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:28:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-11-22 14:28:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-22 14:28:40,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:40,538 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:40,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:40,741 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-11-22 14:28:40,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:40,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905079603] [2019-11-22 14:28:40,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 14:28:40,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905079603] [2019-11-22 14:28:40,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:40,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 14:28:40,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068384571] [2019-11-22 14:28:40,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 14:28:40,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 14:28:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:28:40,892 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-11-22 14:28:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:41,445 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-22 14:28:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 14:28:41,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-22 14:28:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:41,447 INFO L225 Difference]: With dead ends: 76 [2019-11-22 14:28:41,448 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 14:28:41,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-22 14:28:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 14:28:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-22 14:28:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 14:28:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-22 14:28:41,456 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-11-22 14:28:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:41,460 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-22 14:28:41,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 14:28:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-22 14:28:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-22 14:28:41,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:41,462 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:28:41,462 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-11-22 14:28:41,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:41,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776055701] [2019-11-22 14:28:41,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-22 14:28:41,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776055701] [2019-11-22 14:28:41,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607087035] [2019-11-22 14:28:41,702 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:28:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:41,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 14:28:41,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 14:28:41,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:28:41,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-11-22 14:28:41,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312829154] [2019-11-22 14:28:41,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:28:41,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:41,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:28:41,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-22 14:28:41,820 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-11-22 14:28:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:41,867 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-22 14:28:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:28:41,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-22 14:28:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:41,869 INFO L225 Difference]: With dead ends: 76 [2019-11-22 14:28:41,869 INFO L226 Difference]: Without dead ends: 75 [2019-11-22 14:28:41,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:28:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-22 14:28:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-22 14:28:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 14:28:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-22 14:28:41,874 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-11-22 14:28:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:41,874 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-22 14:28:41,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:28:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-22 14:28:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-22 14:28:41,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:41,875 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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:28:42,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:42,079 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-11-22 14:28:42,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:42,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438857852] [2019-11-22 14:28:42,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-22 14:28:42,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438857852] [2019-11-22 14:28:42,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035954391] [2019-11-22 14:28:42,708 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:28:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:42,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-22 14:28:42,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:42,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-22 14:28:42,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:42,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:42,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:28:42,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-22 14:28:43,019 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 11 treesize of output 7 [2019-11-22 14:28:43,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:43,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:43,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:28:43,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-22 14:28:43,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:43,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-22 14:28:43,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:43,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:43,114 INFO L567 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-22 14:28:43,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:43,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:43,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-11-22 14:28:43,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:43,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:43,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:43,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:43,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:28:44,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-22 14:28:44,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:44,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:44,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:28:44,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-22 14:28:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-22 14:28:44,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:28:44,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-11-22 14:28:44,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878701158] [2019-11-22 14:28:44,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 14:28:44,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 14:28:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 14:28:44,226 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-11-22 14:28:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:47,229 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-22 14:28:47,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-22 14:28:47,229 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-11-22 14:28:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:47,231 INFO L225 Difference]: With dead ends: 78 [2019-11-22 14:28:47,231 INFO L226 Difference]: Without dead ends: 78 [2019-11-22 14:28:47,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-11-22 14:28:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-22 14:28:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-22 14:28:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-22 14:28:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-22 14:28:47,239 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-11-22 14:28:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:47,240 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-22 14:28:47,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 14:28:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-22 14:28:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-22 14:28:47,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:47,241 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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:28:47,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:47,449 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:47,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-11-22 14:28:47,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:47,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176607772] [2019-11-22 14:28:47,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 14:28:47,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176607772] [2019-11-22 14:28:47,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:28:47,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 14:28:47,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892894743] [2019-11-22 14:28:47,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 14:28:47,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 14:28:47,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-22 14:28:47,750 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-11-22 14:28:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:48,638 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-11-22 14:28:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 14:28:48,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-11-22 14:28:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:48,639 INFO L225 Difference]: With dead ends: 126 [2019-11-22 14:28:48,639 INFO L226 Difference]: Without dead ends: 126 [2019-11-22 14:28:48,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-11-22 14:28:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-22 14:28:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-22 14:28:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-22 14:28:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-11-22 14:28:48,644 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-11-22 14:28:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:48,645 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-11-22 14:28:48,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 14:28:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-11-22 14:28:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-22 14:28:48,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:48,646 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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:28:48,646 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:48,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-11-22 14:28:48,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:48,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115991547] [2019-11-22 14:28:48,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-22 14:28:49,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115991547] [2019-11-22 14:28:49,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102065397] [2019-11-22 14:28:49,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:49,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 14:28:49,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:49,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-22 14:28:49,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:49,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:49,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:49,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-22 14:28:49,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-22 14:28:49,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:49,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:49,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:49,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-22 14:28:49,538 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 14:28:49,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 14:28:49,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:49,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:49,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:49,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 14:28:49,708 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 14:28:49,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 14:28:49,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:49,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:49,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:49,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 14:28:49,856 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 14:28:49,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 14:28:49,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:49,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:49,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:49,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 14:28:50,010 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 14:28:50,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 14:28:50,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:50,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:50,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:50,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 14:28:50,148 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 14:28:50,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 14:28:50,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:50,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:50,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:50,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 14:28:50,292 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 14:28:50,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 14:28:50,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:50,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:50,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:50,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 14:28:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-22 14:28:50,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:28:50,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-11-22 14:28:50,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314898991] [2019-11-22 14:28:50,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 14:28:50,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:50,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 14:28:50,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-22 14:28:50,444 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-11-22 14:28:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:28:50,915 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-22 14:28:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:28:50,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-11-22 14:28:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:28:50,918 INFO L225 Difference]: With dead ends: 118 [2019-11-22 14:28:50,918 INFO L226 Difference]: Without dead ends: 83 [2019-11-22 14:28:50,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:28:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-22 14:28:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-22 14:28:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-22 14:28:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-11-22 14:28:50,922 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-11-22 14:28:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:28:50,923 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-11-22 14:28:50,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 14:28:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-11-22 14:28:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-22 14:28:50,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:28:50,924 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 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:28:51,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:51,128 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 14:28:51,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:28:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-11-22 14:28:51,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:28:51,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181189667] [2019-11-22 14:28:51,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:28:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 14:28:51,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181189667] [2019-11-22 14:28:51,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359153258] [2019-11-22 14:28:51,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:28:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:28:51,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-22 14:28:51,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:28:51,907 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 11 treesize of output 7 [2019-11-22 14:28:51,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:51,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:51,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:51,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-22 14:28:52,522 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 31 treesize of output 19 [2019-11-22 14:28:52,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:28:52,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:28:52,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:28:52,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-22 14:28:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 14:28:52,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:28:52,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-11-22 14:28:52,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161574912] [2019-11-22 14:28:52,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-22 14:28:52,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:28:52,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-22 14:28:52,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-11-22 14:28:52,608 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-11-22 14:28:57,631 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-22 14:29:00,669 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-22 14:29:01,605 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-22 14:29:04,096 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-22 14:29:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:04,491 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-11-22 14:29:04,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-22 14:29:04,491 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-11-22 14:29:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:04,492 INFO L225 Difference]: With dead ends: 117 [2019-11-22 14:29:04,492 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:29:04,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-11-22 14:29:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:29:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:29:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:29:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:29:04,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-22 14:29:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:04,494 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:29:04,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-22 14:29:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:29:04,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:29:04,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:04,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:29:04 BoogieIcfgContainer [2019-11-22 14:29:04,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:29:04,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:29:04,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:29:04,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:29:04,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:28" (3/4) ... [2019-11-22 14:29:04,707 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:29:04,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 14:29:04,715 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-11-22 14:29:04,715 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-11-22 14:29:04,715 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 14:29:04,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 14:29:04,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 14:29:04,723 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-11-22 14:29:04,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-22 14:29:04,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-22 14:29:04,725 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:29:04,780 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:29:04,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:29:04,781 INFO L168 Benchmark]: Toolchain (without parser) took 37241.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.8 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -280.1 MB). Peak memory consumption was 125.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:04,782 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:29:04,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:04,782 INFO L168 Benchmark]: Boogie Preprocessor took 45.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:29:04,783 INFO L168 Benchmark]: RCFGBuilder took 671.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:04,783 INFO L168 Benchmark]: TraceAbstraction took 36052.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.5 MB). Peak memory consumption was 115.4 MB. Max. memory is 11.5 GB. [2019-11-22 14:29:04,784 INFO L168 Benchmark]: Witness Printer took 77.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 432.7 kB). Peak memory consumption was 432.7 kB. Max. memory is 11.5 GB. [2019-11-22 14:29:04,786 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 671.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36052.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.5 MB). Peak memory consumption was 115.4 MB. Max. memory is 11.5 GB. * Witness Printer took 77.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 432.7 kB). Peak memory consumption was 432.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 36 error locations. Result: SAFE, OverallTime: 35.9s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7643 SolverSat, 799 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=19, 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, 21 MinimizatonAttempts, 155 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1341 ConstructedInterpolants, 134 QuantifiedInterpolants, 833189 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 341/444 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...