./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 c1f4b5c4 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.25-c1f4b5c [2019-12-08 16:26:44,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 16:26:44,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 16:26:44,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 16:26:44,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 16:26:44,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 16:26:44,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 16:26:44,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 16:26:44,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 16:26:44,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 16:26:44,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 16:26:44,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 16:26:44,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 16:26:44,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 16:26:44,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 16:26:44,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 16:26:44,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 16:26:44,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 16:26:45,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 16:26:45,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 16:26:45,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 16:26:45,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 16:26:45,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 16:26:45,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 16:26:45,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 16:26:45,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 16:26:45,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 16:26:45,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 16:26:45,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 16:26:45,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 16:26:45,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 16:26:45,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 16:26:45,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 16:26:45,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 16:26:45,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 16:26:45,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 16:26:45,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 16:26:45,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 16:26:45,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 16:26:45,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 16:26:45,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 16:26:45,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-08 16:26:45,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 16:26:45,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 16:26:45,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 16:26:45,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 16:26:45,045 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 16:26:45,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 16:26:45,046 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 16:26:45,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-08 16:26:45,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 16:26:45,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 16:26:45,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 16:26:45,047 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-08 16:26:45,047 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-08 16:26:45,047 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-08 16:26:45,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 16:26:45,048 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-08 16:26:45,048 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 16:26:45,048 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 16:26:45,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 16:26:45,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 16:26:45,049 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 16:26:45,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 16:26:45,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 16:26:45,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 16:26:45,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 16:26:45,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-08 16:26:45,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-08 16:26:45,050 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 16:26:45,051 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-12-08 16:26:45,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 16:26:45,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 16:26:45,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 16:26:45,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 16:26:45,436 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 16:26:45,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-12-08 16:26:45,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2584892/9544e0154398496992689233d4f70c3a/FLAGcb641c205 [2019-12-08 16:26:45,930 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 16:26:45,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-12-08 16:26:45,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2584892/9544e0154398496992689233d4f70c3a/FLAGcb641c205 [2019-12-08 16:26:46,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2584892/9544e0154398496992689233d4f70c3a [2019-12-08 16:26:46,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 16:26:46,343 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-08 16:26:46,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 16:26:46,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 16:26:46,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 16:26:46,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ce1e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46, skipping insertion in model container [2019-12-08 16:26:46,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 16:26:46,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:26:46,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:26:46,591 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 16:26:46,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:26:46,703 INFO L208 MainTranslator]: Completed translation [2019-12-08 16:26:46,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46 WrapperNode [2019-12-08 16:26:46,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 16:26:46,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 16:26:46,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 16:26:46,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 16:26:46,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (1/1) ... [2019-12-08 16:26:46,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 16:26:46,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 16:26:46,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 16:26:46,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 16:26:46,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (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-12-08 16:26:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-08 16:26:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 16:26:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-12-08 16:26:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-12-08 16:26:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-12-08 16:26:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-08 16:26:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-08 16:26:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-08 16:26:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-08 16:26:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-08 16:26:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-12-08 16:26:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-08 16:26:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-12-08 16:26:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-12-08 16:26:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-08 16:26:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-12-08 16:26:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-08 16:26:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-08 16:26:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-08 16:26:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-08 16:26:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-08 16:26:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 16:26:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-08 16:26:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 16:26:47,378 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 16:26:47,379 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-08 16:26:47,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:26:47 BoogieIcfgContainer [2019-12-08 16:26:47,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 16:26:47,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 16:26:47,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 16:26:47,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 16:26:47,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:26:46" (1/3) ... [2019-12-08 16:26:47,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf19083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:26:47, skipping insertion in model container [2019-12-08 16:26:47,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:46" (2/3) ... [2019-12-08 16:26:47,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf19083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:26:47, skipping insertion in model container [2019-12-08 16:26:47,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:26:47" (3/3) ... [2019-12-08 16:26:47,387 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-12-08 16:26:47,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 16:26:47,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-12-08 16:26:47,416 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-12-08 16:26:47,435 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 16:26:47,436 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-08 16:26:47,436 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 16:26:47,436 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 16:26:47,436 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 16:26:47,436 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 16:26:47,437 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 16:26:47,437 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 16:26:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-12-08 16:26:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:26:47,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:47,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:26:47,467 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-12-08 16:26:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-12-08 16:26:47,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:47,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357042444] [2019-12-08 16:26:47,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:47,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357042444] [2019-12-08 16:26:47,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:47,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:26:47,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748167490] [2019-12-08 16:26:47,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:26:47,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:47,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:26:47,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:26:47,799 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-12-08 16:26:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:48,519 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-12-08 16:26:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 16:26:48,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-08 16:26:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:48,536 INFO L225 Difference]: With dead ends: 103 [2019-12-08 16:26:48,536 INFO L226 Difference]: Without dead ends: 100 [2019-12-08 16:26:48,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-08 16:26:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-08 16:26:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-12-08 16:26:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-08 16:26:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-12-08 16:26:48,596 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-12-08 16:26:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:48,596 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-12-08 16:26:48,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:26:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-12-08 16:26:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:26:48,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:48,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:26:48,598 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-12-08 16:26:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-12-08 16:26:48,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:48,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489626630] [2019-12-08 16:26:48,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:48,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489626630] [2019-12-08 16:26:48,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:48,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:26:48,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702697224] [2019-12-08 16:26:48,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:26:48,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:48,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:26:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:26:48,838 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-12-08 16:26:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:49,405 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-12-08 16:26:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 16:26:49,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-08 16:26:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:49,410 INFO L225 Difference]: With dead ends: 99 [2019-12-08 16:26:49,411 INFO L226 Difference]: Without dead ends: 99 [2019-12-08 16:26:49,412 INFO L631 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-12-08 16:26:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-08 16:26:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-12-08 16:26:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-08 16:26:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-12-08 16:26:49,437 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-12-08 16:26:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:49,438 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-12-08 16:26:49,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:26:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-12-08 16:26:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-08 16:26:49,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:49,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:26:49,441 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-12-08 16:26:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-12-08 16:26:49,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:49,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158660462] [2019-12-08 16:26:49,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:49,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158660462] [2019-12-08 16:26:49,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:49,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:26:49,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943073780] [2019-12-08 16:26:49,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:26:49,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:26:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:26:49,618 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-12-08 16:26:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:50,161 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-12-08 16:26:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 16:26:50,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-08 16:26:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:50,168 INFO L225 Difference]: With dead ends: 98 [2019-12-08 16:26:50,168 INFO L226 Difference]: Without dead ends: 98 [2019-12-08 16:26:50,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-08 16:26:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-08 16:26:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-12-08 16:26:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-08 16:26:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-12-08 16:26:50,189 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-12-08 16:26:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:50,190 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-12-08 16:26:50,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:26:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-12-08 16:26:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-08 16:26:50,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:50,193 INFO L411 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-12-08 16:26:50,194 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-12-08 16:26:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-12-08 16:26:50,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:50,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230219261] [2019-12-08 16:26:50,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:50,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230219261] [2019-12-08 16:26:50,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:50,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:26:50,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481339024] [2019-12-08 16:26:50,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:26:50,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:50,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:26:50,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:26:50,348 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-12-08 16:26:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:50,834 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-12-08 16:26:50,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 16:26:50,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-08 16:26:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:50,836 INFO L225 Difference]: With dead ends: 96 [2019-12-08 16:26:50,836 INFO L226 Difference]: Without dead ends: 96 [2019-12-08 16:26:50,837 INFO L631 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-12-08 16:26:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-08 16:26:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-12-08 16:26:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-08 16:26:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-12-08 16:26:50,845 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-12-08 16:26:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:50,846 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-12-08 16:26:50,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:26:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-12-08 16:26:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-08 16:26:50,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:50,847 INFO L411 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-12-08 16:26:50,847 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-12-08 16:26:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-12-08 16:26:50,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:50,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580504494] [2019-12-08 16:26:50,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:51,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580504494] [2019-12-08 16:26:51,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:51,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-08 16:26:51,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862261635] [2019-12-08 16:26:51,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-08 16:26:51,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-08 16:26:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-08 16:26:51,050 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-12-08 16:26:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:52,066 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-12-08 16:26:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-08 16:26:52,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-08 16:26:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:52,069 INFO L225 Difference]: With dead ends: 116 [2019-12-08 16:26:52,069 INFO L226 Difference]: Without dead ends: 116 [2019-12-08 16:26:52,070 INFO L631 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-12-08 16:26:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-08 16:26:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-12-08 16:26:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-08 16:26:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-12-08 16:26:52,079 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-12-08 16:26:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:52,079 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-12-08 16:26:52,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-08 16:26:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-12-08 16:26:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-08 16:26:52,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:52,086 INFO L411 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-12-08 16:26:52,087 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-12-08 16:26:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-12-08 16:26:52,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:52,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53932554] [2019-12-08 16:26:52,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:52,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53932554] [2019-12-08 16:26:52,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:52,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-08 16:26:52,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743644414] [2019-12-08 16:26:52,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-08 16:26:52,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-08 16:26:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-08 16:26:52,356 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-12-08 16:26:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:53,265 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-12-08 16:26:53,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-08 16:26:53,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-08 16:26:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:53,272 INFO L225 Difference]: With dead ends: 99 [2019-12-08 16:26:53,272 INFO L226 Difference]: Without dead ends: 99 [2019-12-08 16:26:53,273 INFO L631 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-12-08 16:26:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-08 16:26:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-12-08 16:26:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-08 16:26:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-12-08 16:26:53,286 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-12-08 16:26:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:53,290 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-12-08 16:26:53,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-08 16:26:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-12-08 16:26:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-08 16:26:53,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:53,292 INFO L411 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-12-08 16:26:53,292 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-12-08 16:26:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-12-08 16:26:53,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:53,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216925112] [2019-12-08 16:26:53,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:53,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216925112] [2019-12-08 16:26:53,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:53,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:26:53,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8263229] [2019-12-08 16:26:53,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:26:53,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:26:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:26:53,424 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-12-08 16:26:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:53,801 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-12-08 16:26:53,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:26:53,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-08 16:26:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:53,803 INFO L225 Difference]: With dead ends: 94 [2019-12-08 16:26:53,803 INFO L226 Difference]: Without dead ends: 94 [2019-12-08 16:26:53,804 INFO L631 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-12-08 16:26:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-08 16:26:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-12-08 16:26:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-08 16:26:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-12-08 16:26:53,810 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-12-08 16:26:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:53,811 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-12-08 16:26:53,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:26:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-12-08 16:26:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-08 16:26:53,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:53,813 INFO L411 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-12-08 16:26:53,813 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-12-08 16:26:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-12-08 16:26:53,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:53,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273199061] [2019-12-08 16:26:53,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:53,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273199061] [2019-12-08 16:26:53,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:53,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:26:53,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235184193] [2019-12-08 16:26:53,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:26:53,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:26:53,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:26:53,938 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-12-08 16:26:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:54,288 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-12-08 16:26:54,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:26:54,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-08 16:26:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:54,290 INFO L225 Difference]: With dead ends: 89 [2019-12-08 16:26:54,290 INFO L226 Difference]: Without dead ends: 89 [2019-12-08 16:26:54,290 INFO L631 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-12-08 16:26:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-08 16:26:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-12-08 16:26:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-08 16:26:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-12-08 16:26:54,296 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-12-08 16:26:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:54,296 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-12-08 16:26:54,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:26:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-12-08 16:26:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-08 16:26:54,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:54,297 INFO L411 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-12-08 16:26:54,298 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-12-08 16:26:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-12-08 16:26:54,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:54,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537224409] [2019-12-08 16:26:54,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:54,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537224409] [2019-12-08 16:26:54,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631084357] [2019-12-08 16:26:54,372 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-12-08 16:26:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-08 16:26:54,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:26:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:54,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-08 16:26:54,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-12-08 16:26:54,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863741415] [2019-12-08 16:26:54,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:26:54,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:54,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:26:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:26:54,473 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-12-08 16:26:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:54,534 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-12-08 16:26:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:26:54,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-08 16:26:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:54,537 INFO L225 Difference]: With dead ends: 112 [2019-12-08 16:26:54,537 INFO L226 Difference]: Without dead ends: 112 [2019-12-08 16:26:54,537 INFO L631 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-12-08 16:26:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-08 16:26:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-12-08 16:26:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-08 16:26:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-12-08 16:26:54,543 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-12-08 16:26:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:54,543 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-12-08 16:26:54,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:26:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-12-08 16:26:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-08 16:26:54,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:54,545 INFO L411 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-12-08 16:26:54,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:26:54,752 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-12-08 16:26:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-12-08 16:26:54,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:54,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314924650] [2019-12-08 16:26:54,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:54,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314924650] [2019-12-08 16:26:54,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:54,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:26:54,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045553008] [2019-12-08 16:26:54,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:26:54,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:54,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:26:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:26:54,880 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-12-08 16:26:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:55,229 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-12-08 16:26:55,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:26:55,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-08 16:26:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:55,231 INFO L225 Difference]: With dead ends: 88 [2019-12-08 16:26:55,231 INFO L226 Difference]: Without dead ends: 88 [2019-12-08 16:26:55,231 INFO L631 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-12-08 16:26:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-08 16:26:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-12-08 16:26:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-08 16:26:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-12-08 16:26:55,239 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-12-08 16:26:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:55,240 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-12-08 16:26:55,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:26:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-12-08 16:26:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-08 16:26:55,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:55,241 INFO L411 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-12-08 16:26:55,242 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-12-08 16:26:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-12-08 16:26:55,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:55,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580008519] [2019-12-08 16:26:55,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:55,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580008519] [2019-12-08 16:26:55,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:55,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:26:55,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569656053] [2019-12-08 16:26:55,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:26:55,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:55,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:26:55,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:26:55,321 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-12-08 16:26:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:55,650 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-12-08 16:26:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:26:55,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-08 16:26:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:55,652 INFO L225 Difference]: With dead ends: 83 [2019-12-08 16:26:55,653 INFO L226 Difference]: Without dead ends: 83 [2019-12-08 16:26:55,653 INFO L631 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-12-08 16:26:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-08 16:26:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-12-08 16:26:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-08 16:26:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-12-08 16:26:55,658 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-12-08 16:26:55,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:55,658 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-12-08 16:26:55,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:26:55,658 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-12-08 16:26:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-08 16:26:55,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:55,659 INFO L411 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-12-08 16:26:55,659 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-12-08 16:26:55,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:55,660 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-12-08 16:26:55,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:55,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382364682] [2019-12-08 16:26:55,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:55,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382364682] [2019-12-08 16:26:55,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428799742] [2019-12-08 16:26:55,741 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-12-08 16:26:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:55,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-08 16:26:55,803 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:26:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:55,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-08 16:26:55,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-12-08 16:26:55,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276877421] [2019-12-08 16:26:55,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:26:55,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:55,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:26:55,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:26:55,824 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-12-08 16:26:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:56,253 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-12-08 16:26:56,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-08 16:26:56,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-12-08 16:26:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:56,255 INFO L225 Difference]: With dead ends: 122 [2019-12-08 16:26:56,255 INFO L226 Difference]: Without dead ends: 122 [2019-12-08 16:26:56,256 INFO L631 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-12-08 16:26:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-08 16:26:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-12-08 16:26:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-08 16:26:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-12-08 16:26:56,262 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-12-08 16:26:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:56,262 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-12-08 16:26:56,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:26:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-12-08 16:26:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-08 16:26:56,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:56,264 INFO L411 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-12-08 16:26:56,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:26:56,469 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-12-08 16:26:56,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-12-08 16:26:56,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:56,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611212243] [2019-12-08 16:26:56,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:56,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611212243] [2019-12-08 16:26:56,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522452478] [2019-12-08 16:26:56,588 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-12-08 16:26:56,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-08 16:26:56,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-08 16:26:56,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-08 16:26:56,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:26:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:26:56,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-08 16:26:56,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-12-08 16:26:56,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079087349] [2019-12-08 16:26:56,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-08 16:26:56,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:56,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-08 16:26:56,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-08 16:26:56,873 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-12-08 16:26:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:58,094 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-12-08 16:26:58,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-08 16:26:58,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-12-08 16:26:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:58,096 INFO L225 Difference]: With dead ends: 123 [2019-12-08 16:26:58,096 INFO L226 Difference]: Without dead ends: 123 [2019-12-08 16:26:58,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-12-08 16:26:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-08 16:26:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-12-08 16:26:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-08 16:26:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-12-08 16:26:58,102 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-12-08 16:26:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:58,103 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-12-08 16:26:58,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-08 16:26:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-12-08 16:26:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-08 16:26:58,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:58,105 INFO L411 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-12-08 16:26:58,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:26:58,310 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-12-08 16:26:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-12-08 16:26:58,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:58,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326182389] [2019-12-08 16:26:58,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-08 16:26:58,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326182389] [2019-12-08 16:26:58,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148927292] [2019-12-08 16:26:58,411 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-12-08 16:26:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-08 16:26:58,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:26:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-08 16:26:58,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-08 16:26:58,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-12-08 16:26:58,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540139025] [2019-12-08 16:26:58,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:26:58,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:26:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-12-08 16:26:58,559 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-12-08 16:26:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:58,626 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-12-08 16:26:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:26:58,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-08 16:26:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:58,630 INFO L225 Difference]: With dead ends: 104 [2019-12-08 16:26:58,630 INFO L226 Difference]: Without dead ends: 101 [2019-12-08 16:26:58,630 INFO L631 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-12-08 16:26:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-08 16:26:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-12-08 16:26:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-08 16:26:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-12-08 16:26:58,636 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-12-08 16:26:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:58,637 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-12-08 16:26:58,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:26:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-12-08 16:26:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-08 16:26:58,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:58,639 INFO L411 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-12-08 16:26:58,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:26:58,843 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-12-08 16:26:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-12-08 16:26:58,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:58,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316948361] [2019-12-08 16:26:58,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-08 16:26:58,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316948361] [2019-12-08 16:26:58,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779415623] [2019-12-08 16:26:58,983 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-12-08 16:26:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-08 16:26:59,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:26:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-08 16:26:59,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-08 16:26:59,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-12-08 16:26:59,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359580674] [2019-12-08 16:26:59,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:26:59,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:59,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:26:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:26:59,134 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-12-08 16:26:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:26:59,206 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-12-08 16:26:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 16:26:59,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-12-08 16:26:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:26:59,208 INFO L225 Difference]: With dead ends: 86 [2019-12-08 16:26:59,208 INFO L226 Difference]: Without dead ends: 76 [2019-12-08 16:26:59,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:26:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-08 16:26:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-12-08 16:26:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-08 16:26:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-12-08 16:26:59,219 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-12-08 16:26:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:26:59,219 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-12-08 16:26:59,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:26:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-12-08 16:26:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-08 16:26:59,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:26:59,221 INFO L411 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-12-08 16:26:59,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:26:59,427 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-12-08 16:26:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:26:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-12-08 16:26:59,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:26:59,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733692995] [2019-12-08 16:26:59,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:26:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:26:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-08 16:26:59,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733692995] [2019-12-08 16:26:59,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:26:59,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-08 16:26:59,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867349569] [2019-12-08 16:26:59,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-08 16:26:59,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:26:59,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-08 16:26:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-08 16:26:59,583 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-12-08 16:27:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:27:00,133 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-12-08 16:27:00,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-08 16:27:00,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-08 16:27:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:27:00,134 INFO L225 Difference]: With dead ends: 76 [2019-12-08 16:27:00,135 INFO L226 Difference]: Without dead ends: 76 [2019-12-08 16:27:00,136 INFO L631 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-12-08 16:27:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-08 16:27:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-12-08 16:27:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-08 16:27:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-12-08 16:27:00,140 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-12-08 16:27:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:27:00,142 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-12-08 16:27:00,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-08 16:27:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-12-08 16:27:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-08 16:27:00,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:27:00,143 INFO L411 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-12-08 16:27:00,143 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-12-08 16:27:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:27:00,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-12-08 16:27:00,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:27:00,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284446203] [2019-12-08 16:27:00,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:27:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-08 16:27:00,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284446203] [2019-12-08 16:27:00,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841007071] [2019-12-08 16:27:00,476 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-12-08 16:27:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:00,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-08 16:27:00,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:27:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-08 16:27:00,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-08 16:27:00,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-12-08 16:27:00,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676777371] [2019-12-08 16:27:00,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:27:00,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:27:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:27:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-08 16:27:00,607 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-12-08 16:27:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:27:00,689 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-12-08 16:27:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:27:00,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-08 16:27:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:27:00,691 INFO L225 Difference]: With dead ends: 76 [2019-12-08 16:27:00,691 INFO L226 Difference]: Without dead ends: 75 [2019-12-08 16:27:00,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-12-08 16:27:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-08 16:27:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-08 16:27:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-08 16:27:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-12-08 16:27:00,696 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-12-08 16:27:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:27:00,696 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-12-08 16:27:00,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:27:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-12-08 16:27:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-08 16:27:00,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:27:00,698 INFO L411 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-12-08 16:27:00,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:27:00,907 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-12-08 16:27:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:27:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-12-08 16:27:00,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:27:00,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312427737] [2019-12-08 16:27:00,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:27:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-08 16:27:01,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312427737] [2019-12-08 16:27:01,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611717563] [2019-12-08 16:27:01,407 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-12-08 16:27:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:01,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-08 16:27:01,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:27:01,600 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-12-08 16:27:01,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:01,610 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:01,611 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:27:01,611 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-08 16:27:01,796 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-12-08 16:27:01,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:01,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:01,806 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:27:01,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-08 16:27:01,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:01,873 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-12-08 16:27:01,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:27:01,878 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:01,907 INFO L614 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-12-08 16:27:01,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:27:01,910 INFO L534 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-12-08 16:27:01,910 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-12-08 16:27:01,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:27:01,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:27:02,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:27:02,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:27:02,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:27:02,937 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-12-08 16:27:02,937 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:02,946 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:02,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:27:02,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-12-08 16:27:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-08 16:27:03,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-08 16:27:03,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-12-08 16:27:03,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511878986] [2019-12-08 16:27:03,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-08 16:27:03,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:27:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-08 16:27:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-12-08 16:27:03,032 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-12-08 16:27:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:27:06,028 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-12-08 16:27:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-08 16:27:06,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-08 16:27:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:27:06,030 INFO L225 Difference]: With dead ends: 78 [2019-12-08 16:27:06,030 INFO L226 Difference]: Without dead ends: 78 [2019-12-08 16:27:06,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-12-08 16:27:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-08 16:27:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-08 16:27:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-08 16:27:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-12-08 16:27:06,035 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-12-08 16:27:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:27:06,035 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-12-08 16:27:06,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-08 16:27:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-12-08 16:27:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-08 16:27:06,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:27:06,036 INFO L411 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-12-08 16:27:06,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:27:06,240 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-12-08 16:27:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:27:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-12-08 16:27:06,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:27:06,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801902879] [2019-12-08 16:27:06,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:27:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-08 16:27:06,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801902879] [2019-12-08 16:27:06,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:27:06,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-08 16:27:06,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314590409] [2019-12-08 16:27:06,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-08 16:27:06,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:27:06,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-08 16:27:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-08 16:27:06,492 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-12-08 16:27:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:27:07,404 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-12-08 16:27:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-08 16:27:07,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-12-08 16:27:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:27:07,407 INFO L225 Difference]: With dead ends: 126 [2019-12-08 16:27:07,407 INFO L226 Difference]: Without dead ends: 126 [2019-12-08 16:27:07,408 INFO L631 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-12-08 16:27:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-08 16:27:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-12-08 16:27:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-08 16:27:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-12-08 16:27:07,414 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-12-08 16:27:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:27:07,414 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-12-08 16:27:07,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-08 16:27:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-12-08 16:27:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-08 16:27:07,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:27:07,416 INFO L411 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-12-08 16:27:07,416 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-12-08 16:27:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:27:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-12-08 16:27:07,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:27:07,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317905033] [2019-12-08 16:27:07,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:27:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-08 16:27:08,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317905033] [2019-12-08 16:27:08,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702872669] [2019-12-08 16:27:08,007 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-12-08 16:27:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:08,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-08 16:27:08,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:27:08,157 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-12-08 16:27:08,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:08,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:08,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:27:08,161 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-08 16:27:08,258 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-12-08 16:27:08,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:08,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:08,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:27:08,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-08 16:27:08,455 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-08 16:27:08,456 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-12-08 16:27:08,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:08,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:08,470 INFO L534 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-12-08 16:27:08,471 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-08 16:27:08,660 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-08 16:27:08,661 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-12-08 16:27:08,661 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:08,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:08,674 INFO L534 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-12-08 16:27:08,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-08 16:27:08,812 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-08 16:27:08,812 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-12-08 16:27:08,813 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:08,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:08,826 INFO L534 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-12-08 16:27:08,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-08 16:27:08,976 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-08 16:27:08,977 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-12-08 16:27:08,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:08,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:08,989 INFO L534 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-12-08 16:27:08,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-08 16:27:09,142 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-08 16:27:09,143 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-12-08 16:27:09,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:09,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:09,161 INFO L534 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-12-08 16:27:09,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-08 16:27:09,308 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-08 16:27:09,308 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-12-08 16:27:09,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:09,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:09,331 INFO L534 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-12-08 16:27:09,331 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-08 16:27:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-08 16:27:09,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-08 16:27:09,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-12-08 16:27:09,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919000985] [2019-12-08 16:27:09,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:27:09,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:27:09,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:27:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-08 16:27:09,482 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-12-08 16:27:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:27:12,018 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-12-08 16:27:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:27:12,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-08 16:27:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:27:12,019 INFO L225 Difference]: With dead ends: 118 [2019-12-08 16:27:12,019 INFO L226 Difference]: Without dead ends: 83 [2019-12-08 16:27:12,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=60, Invalid=359, Unknown=1, NotChecked=0, Total=420 [2019-12-08 16:27:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-08 16:27:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-08 16:27:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-08 16:27:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-12-08 16:27:12,024 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-12-08 16:27:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:27:12,025 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-12-08 16:27:12,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:27:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-12-08 16:27:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 16:27:12,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:27:12,026 INFO L411 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-12-08 16:27:12,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:27:12,229 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-12-08 16:27:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:27:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-12-08 16:27:12,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:27:12,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357211731] [2019-12-08 16:27:12,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:27:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-08 16:27:12,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357211731] [2019-12-08 16:27:12,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214264853] [2019-12-08 16:27:12,641 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-12-08 16:27:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:27:12,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-08 16:27:12,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:27:13,075 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-12-08 16:27:13,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:13,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:13,084 INFO L534 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-12-08 16:27:13,085 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-12-08 16:27:13,813 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-12-08 16:27:13,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:27:13,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:27:13,834 INFO L534 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-12-08 16:27:13,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-12-08 16:27:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-08 16:27:13,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-08 16:27:13,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-12-08 16:27:13,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629152887] [2019-12-08 16:27:13,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-08 16:27:13,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:27:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-08 16:27:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-12-08 16:27:13,953 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-12-08 16:27:15,520 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-12-08 16:27:16,732 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-12-08 16:27:19,674 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-08 16:27:20,615 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-12-08 16:27:20,929 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-08 16:27:21,392 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-12-08 16:27:23,842 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-12-08 16:27:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:27:23,844 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-12-08 16:27:23,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-08 16:27:23,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-12-08 16:27:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:27:23,845 INFO L225 Difference]: With dead ends: 117 [2019-12-08 16:27:23,845 INFO L226 Difference]: Without dead ends: 0 [2019-12-08 16:27:23,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-12-08 16:27:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-08 16:27:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-08 16:27:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-08 16:27:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-08 16:27:23,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-12-08 16:27:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:27:23,848 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-08 16:27:23,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-08 16:27:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-08 16:27:23,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-08 16:27:24,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:27:24,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:27:24 BoogieIcfgContainer [2019-12-08 16:27:24,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 16:27:24,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 16:27:24,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 16:27:24,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 16:27:24,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:26:47" (3/4) ... [2019-12-08 16:27:24,062 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-08 16:27:24,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-08 16:27:24,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-12-08 16:27:24,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-12-08 16:27:24,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-08 16:27:24,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-12-08 16:27:24,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-08 16:27:24,079 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-12-08 16:27:24,080 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-08 16:27:24,080 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-08 16:27:24,081 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-08 16:27:24,139 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-12-08 16:27:24,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 16:27:24,140 INFO L168 Benchmark]: Toolchain (without parser) took 37798.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 955.0 MB in the beginning and 830.8 MB in the end (delta: 124.2 MB). Peak memory consumption was 543.1 MB. Max. memory is 11.5 GB. [2019-12-08 16:27:24,141 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:27:24,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-12-08 16:27:24,142 INFO L168 Benchmark]: Boogie Preprocessor took 50.98 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-12-08 16:27:24,142 INFO L168 Benchmark]: RCFGBuilder took 622.74 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-08 16:27:24,143 INFO L168 Benchmark]: TraceAbstraction took 36675.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 292.0 MB). Free memory was 1.1 GB in the beginning and 830.8 MB in the end (delta: 248.0 MB). Peak memory consumption was 540.0 MB. Max. memory is 11.5 GB. [2019-12-08 16:27:24,143 INFO L168 Benchmark]: Witness Printer took 82.20 ms. Allocated memory is still 1.4 GB. Free memory is still 830.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:27:24,145 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.98 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 622.74 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36675.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 292.0 MB). Free memory was 1.1 GB in the beginning and 830.8 MB in the end (delta: 248.0 MB). Peak memory consumption was 540.0 MB. Max. memory is 11.5 GB. * Witness Printer took 82.20 ms. Allocated memory is still 1.4 GB. Free memory is still 830.8 MB. There was no memory consumed. 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: 36.6s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7644 SolverSat, 799 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 15.8s 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.7s SatisfiabilityAnalysisTime, 8.2s 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...