./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer --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 3dcfb71b16f6783353008d1be8597dab2a9bd20e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 19:36:12,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:36:12,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:36:12,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:36:12,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:36:12,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:36:12,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:36:12,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:36:12,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:36:12,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:36:12,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:36:12,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:36:12,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:36:12,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:36:12,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:36:12,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:36:12,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:36:12,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:36:12,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:36:12,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:36:12,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:36:12,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:36:12,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:36:12,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:36:12,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:36:12,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:36:12,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:36:12,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:36:12,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:36:12,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:36:12,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:36:12,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:36:12,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:36:12,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:36:12,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:36:12,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:36:12,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:36:12,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:36:12,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:36:12,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:36:12,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:36:12,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-29 19:36:12,572 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:36:12,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:36:12,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:36:12,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:36:12,576 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:36:12,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:36:12,576 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:36:12,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:36:12,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:36:12,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:36:12,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:36:12,577 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-29 19:36:12,577 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-29 19:36:12,578 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-29 19:36:12,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:36:12,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-29 19:36:12,578 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:36:12,578 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:36:12,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:36:12,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:36:12,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:36:12,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:36:12,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:36:12,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:36:12,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:36:12,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:36:12,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:36:12,581 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:36:12,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer 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 -> 3dcfb71b16f6783353008d1be8597dab2a9bd20e [2020-11-29 19:36:12,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:36:12,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:36:12,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:36:12,919 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:36:12,923 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:36:12,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2020-11-29 19:36:12,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/data/f9b9427b0/04e2a486f28c4c498a0e0ba5f27b9839/FLAG4dc9ec838 [2020-11-29 19:36:13,602 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:36:13,602 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2020-11-29 19:36:13,619 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/data/f9b9427b0/04e2a486f28c4c498a0e0ba5f27b9839/FLAG4dc9ec838 [2020-11-29 19:36:13,888 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/data/f9b9427b0/04e2a486f28c4c498a0e0ba5f27b9839 [2020-11-29 19:36:13,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:36:13,893 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-29 19:36:13,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:36:13,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:36:13,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:36:13,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:36:13" (1/1) ... [2020-11-29 19:36:13,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8b4f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:13, skipping insertion in model container [2020-11-29 19:36:13,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:36:13" (1/1) ... [2020-11-29 19:36:13,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:36:14,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:36:14,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:36:14,503 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:36:14,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:36:14,676 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:36:14,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14 WrapperNode [2020-11-29 19:36:14,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:36:14,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:36:14,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:36:14,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:36:14,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... [2020-11-29 19:36:14,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... [2020-11-29 19:36:14,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... [2020-11-29 19:36:14,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... [2020-11-29 19:36:14,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... [2020-11-29 19:36:14,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... [2020-11-29 19:36:14,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... [2020-11-29 19:36:14,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:36:14,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:36:14,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:36:14,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:36:14,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/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 [2020-11-29 19:36:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-29 19:36:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:36:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-29 19:36:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-11-29 19:36:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2020-11-29 19:36:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2020-11-29 19:36:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2020-11-29 19:36:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2020-11-29 19:36:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2020-11-29 19:36:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2020-11-29 19:36:14,920 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2020-11-29 19:36:14,920 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-11-29 19:36:14,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-29 19:36:14,921 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2020-11-29 19:36:14,921 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2020-11-29 19:36:14,921 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2020-11-29 19:36:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2020-11-29 19:36:14,924 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2020-11-29 19:36:14,924 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-11-29 19:36:14,924 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-11-29 19:36:14,924 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-11-29 19:36:14,924 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-11-29 19:36:14,924 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-11-29 19:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2020-11-29 19:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2020-11-29 19:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2020-11-29 19:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2020-11-29 19:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2020-11-29 19:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2020-11-29 19:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2020-11-29 19:36:14,926 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-11-29 19:36:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-29 19:36:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-29 19:36:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-29 19:36:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:36:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-29 19:36:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-29 19:36:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-11-29 19:36:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2020-11-29 19:36:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2020-11-29 19:36:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2020-11-29 19:36:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2020-11-29 19:36:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2020-11-29 19:36:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2020-11-29 19:36:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2020-11-29 19:36:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2020-11-29 19:36:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2020-11-29 19:36:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2020-11-29 19:36:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2020-11-29 19:36:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-11-29 19:36:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-11-29 19:36:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-11-29 19:36:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2020-11-29 19:36:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2020-11-29 19:36:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2020-11-29 19:36:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2020-11-29 19:36:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2020-11-29 19:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2020-11-29 19:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2020-11-29 19:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-11-29 19:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-11-29 19:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-11-29 19:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2020-11-29 19:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-11-29 19:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-29 19:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-11-29 19:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-29 19:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:36:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:36:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 19:36:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:36:15,423 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:15,493 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:15,494 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:15,540 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:15,664 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:15,664 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:15,672 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:15,946 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2020-11-29 19:36:15,947 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2020-11-29 19:36:15,949 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,051 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2020-11-29 19:36:16,051 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2020-11-29 19:36:16,079 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,147 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-11-29 19:36:16,147 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-11-29 19:36:16,303 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,318 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:16,318 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:16,319 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,349 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:16,349 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:16,349 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,363 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:16,363 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:16,410 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,479 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-11-29 19:36:16,479 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-11-29 19:36:16,482 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,651 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2020-11-29 19:36:16,651 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2020-11-29 19:36:16,712 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,722 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:16,722 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:16,723 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,744 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:16,744 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:16,744 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 19:36:16,753 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 19:36:16,753 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 19:36:16,784 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:36:16,784 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-29 19:36:16,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:36:16 BoogieIcfgContainer [2020-11-29 19:36:16,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:36:16,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:36:16,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:36:16,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:36:16,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:36:13" (1/3) ... [2020-11-29 19:36:16,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f23a7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:36:16, skipping insertion in model container [2020-11-29 19:36:16,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:36:14" (2/3) ... [2020-11-29 19:36:16,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f23a7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:36:16, skipping insertion in model container [2020-11-29 19:36:16,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:36:16" (3/3) ... [2020-11-29 19:36:16,798 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2020-11-29 19:36:16,822 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:36:16,827 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 19:36:16,837 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-29 19:36:16,854 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:36:16,855 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-29 19:36:16,855 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:36:16,855 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:36:16,855 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:36:16,855 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:36:16,855 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:36:16,855 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:36:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states. [2020-11-29 19:36:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 19:36:16,889 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:16,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:16,891 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash -128725437, now seen corresponding path program 1 times [2020-11-29 19:36:16,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:16,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442016937] [2020-11-29 19:36:16,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:17,355 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:17,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:17,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:17,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442016937] [2020-11-29 19:36:17,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:17,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:36:17,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883444452] [2020-11-29 19:36:17,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:36:17,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:36:17,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:36:17,465 INFO L87 Difference]: Start difference. First operand 394 states. Second operand 4 states. [2020-11-29 19:36:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:19,255 INFO L93 Difference]: Finished difference Result 430 states and 604 transitions. [2020-11-29 19:36:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:36:19,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-29 19:36:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:19,284 INFO L225 Difference]: With dead ends: 430 [2020-11-29 19:36:19,284 INFO L226 Difference]: Without dead ends: 423 [2020-11-29 19:36:19,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:36:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-11-29 19:36:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 381. [2020-11-29 19:36:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-11-29 19:36:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 525 transitions. [2020-11-29 19:36:19,416 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 525 transitions. Word has length 15 [2020-11-29 19:36:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:19,417 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 525 transitions. [2020-11-29 19:36:19,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:36:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 525 transitions. [2020-11-29 19:36:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 19:36:19,419 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:19,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:19,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:36:19,419 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:19,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:19,422 INFO L82 PathProgramCache]: Analyzing trace with hash 620063704, now seen corresponding path program 1 times [2020-11-29 19:36:19,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:19,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38089258] [2020-11-29 19:36:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:19,738 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:19,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:19,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:19,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38089258] [2020-11-29 19:36:19,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:19,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:36:19,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272251079] [2020-11-29 19:36:19,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:36:19,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:19,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:36:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:36:19,844 INFO L87 Difference]: Start difference. First operand 381 states and 525 transitions. Second operand 5 states. [2020-11-29 19:36:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:21,886 INFO L93 Difference]: Finished difference Result 423 states and 587 transitions. [2020-11-29 19:36:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:36:21,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-29 19:36:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:21,895 INFO L225 Difference]: With dead ends: 423 [2020-11-29 19:36:21,897 INFO L226 Difference]: Without dead ends: 423 [2020-11-29 19:36:21,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:36:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-11-29 19:36:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 381. [2020-11-29 19:36:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-11-29 19:36:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 524 transitions. [2020-11-29 19:36:21,944 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 524 transitions. Word has length 21 [2020-11-29 19:36:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:21,944 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 524 transitions. [2020-11-29 19:36:21,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:36:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 524 transitions. [2020-11-29 19:36:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 19:36:21,946 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:21,946 INFO L422 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] [2020-11-29 19:36:21,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:36:21,947 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1978377459, now seen corresponding path program 1 times [2020-11-29 19:36:21,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:21,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671382751] [2020-11-29 19:36:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:22,206 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:22,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:22,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:22,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:22,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671382751] [2020-11-29 19:36:22,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:22,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:36:22,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174801031] [2020-11-29 19:36:22,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:36:22,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:36:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:36:22,324 INFO L87 Difference]: Start difference. First operand 381 states and 524 transitions. Second operand 6 states. [2020-11-29 19:36:22,490 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 19:36:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:25,354 INFO L93 Difference]: Finished difference Result 587 states and 800 transitions. [2020-11-29 19:36:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:36:25,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-29 19:36:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:25,361 INFO L225 Difference]: With dead ends: 587 [2020-11-29 19:36:25,361 INFO L226 Difference]: Without dead ends: 586 [2020-11-29 19:36:25,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:36:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-11-29 19:36:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 526. [2020-11-29 19:36:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2020-11-29 19:36:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 717 transitions. [2020-11-29 19:36:25,390 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 717 transitions. Word has length 26 [2020-11-29 19:36:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:25,391 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 717 transitions. [2020-11-29 19:36:25,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:36:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 717 transitions. [2020-11-29 19:36:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-29 19:36:25,393 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:25,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:25,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:36:25,393 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:25,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1627700583, now seen corresponding path program 1 times [2020-11-29 19:36:25,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:25,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026858144] [2020-11-29 19:36:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:25,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:25,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:25,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:25,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026858144] [2020-11-29 19:36:25,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:25,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:36:25,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302429302] [2020-11-29 19:36:25,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:36:25,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:36:25,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:36:25,749 INFO L87 Difference]: Start difference. First operand 526 states and 717 transitions. Second operand 6 states. [2020-11-29 19:36:25,898 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:36:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:27,612 INFO L93 Difference]: Finished difference Result 678 states and 908 transitions. [2020-11-29 19:36:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:36:27,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-11-29 19:36:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:27,618 INFO L225 Difference]: With dead ends: 678 [2020-11-29 19:36:27,618 INFO L226 Difference]: Without dead ends: 678 [2020-11-29 19:36:27,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:36:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-11-29 19:36:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 584. [2020-11-29 19:36:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-11-29 19:36:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 791 transitions. [2020-11-29 19:36:27,663 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 791 transitions. Word has length 32 [2020-11-29 19:36:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:27,663 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 791 transitions. [2020-11-29 19:36:27,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:36:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 791 transitions. [2020-11-29 19:36:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 19:36:27,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:27,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:27,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:36:27,672 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1420820873, now seen corresponding path program 1 times [2020-11-29 19:36:27,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:27,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688834735] [2020-11-29 19:36:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:27,930 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:27,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:28,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:28,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:28,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688834735] [2020-11-29 19:36:28,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:28,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:36:28,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419278004] [2020-11-29 19:36:28,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:36:28,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:36:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:36:28,036 INFO L87 Difference]: Start difference. First operand 584 states and 791 transitions. Second operand 6 states. [2020-11-29 19:36:28,189 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:36:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:30,323 INFO L93 Difference]: Finished difference Result 821 states and 1104 transitions. [2020-11-29 19:36:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:36:30,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-29 19:36:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:30,329 INFO L225 Difference]: With dead ends: 821 [2020-11-29 19:36:30,329 INFO L226 Difference]: Without dead ends: 821 [2020-11-29 19:36:30,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:36:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2020-11-29 19:36:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 772. [2020-11-29 19:36:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-11-29 19:36:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1048 transitions. [2020-11-29 19:36:30,360 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1048 transitions. Word has length 34 [2020-11-29 19:36:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:30,360 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1048 transitions. [2020-11-29 19:36:30,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:36:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1048 transitions. [2020-11-29 19:36:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 19:36:30,362 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:30,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:30,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:36:30,363 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:30,364 INFO L82 PathProgramCache]: Analyzing trace with hash 697139832, now seen corresponding path program 1 times [2020-11-29 19:36:30,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:30,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561117024] [2020-11-29 19:36:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:30,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:30,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:30,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:30,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 19:36:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:30,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:36:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:30,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561117024] [2020-11-29 19:36:30,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:30,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:36:30,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051445381] [2020-11-29 19:36:30,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:36:30,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:36:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:36:30,627 INFO L87 Difference]: Start difference. First operand 772 states and 1048 transitions. Second operand 8 states. [2020-11-29 19:36:30,815 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 19:36:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:32,728 INFO L93 Difference]: Finished difference Result 862 states and 1159 transitions. [2020-11-29 19:36:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:36:32,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-11-29 19:36:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:32,736 INFO L225 Difference]: With dead ends: 862 [2020-11-29 19:36:32,736 INFO L226 Difference]: Without dead ends: 862 [2020-11-29 19:36:32,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:36:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2020-11-29 19:36:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 809. [2020-11-29 19:36:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-11-29 19:36:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1091 transitions. [2020-11-29 19:36:32,767 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1091 transitions. Word has length 40 [2020-11-29 19:36:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:32,768 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1091 transitions. [2020-11-29 19:36:32,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:36:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1091 transitions. [2020-11-29 19:36:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 19:36:32,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:32,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:32,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 19:36:32,770 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:32,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1521263464, now seen corresponding path program 1 times [2020-11-29 19:36:32,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:32,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482034812] [2020-11-29 19:36:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:32,990 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:32,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:33,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:33,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:33,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482034812] [2020-11-29 19:36:33,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:33,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:36:33,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087669692] [2020-11-29 19:36:33,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:36:33,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:33,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:36:33,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:36:33,080 INFO L87 Difference]: Start difference. First operand 809 states and 1091 transitions. Second operand 6 states. [2020-11-29 19:36:33,285 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 19:36:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:34,894 INFO L93 Difference]: Finished difference Result 840 states and 1129 transitions. [2020-11-29 19:36:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:36:34,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-11-29 19:36:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:34,900 INFO L225 Difference]: With dead ends: 840 [2020-11-29 19:36:34,900 INFO L226 Difference]: Without dead ends: 840 [2020-11-29 19:36:34,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:36:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-11-29 19:36:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 820. [2020-11-29 19:36:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-11-29 19:36:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1105 transitions. [2020-11-29 19:36:34,929 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1105 transitions. Word has length 39 [2020-11-29 19:36:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:34,929 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1105 transitions. [2020-11-29 19:36:34,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:36:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1105 transitions. [2020-11-29 19:36:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 19:36:34,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:34,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:34,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 19:36:34,932 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -362508606, now seen corresponding path program 1 times [2020-11-29 19:36:34,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:34,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879049524] [2020-11-29 19:36:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:35,192 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:35,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:35,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:35,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:35,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 19:36:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:35,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:36:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:35,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879049524] [2020-11-29 19:36:35,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:35,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:36:35,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580696649] [2020-11-29 19:36:35,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:36:35,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:35,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:36:35,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:36:35,427 INFO L87 Difference]: Start difference. First operand 820 states and 1105 transitions. Second operand 12 states. [2020-11-29 19:36:35,607 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:36:35,751 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:36:36,704 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2020-11-29 19:36:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:37,437 INFO L93 Difference]: Finished difference Result 873 states and 1172 transitions. [2020-11-29 19:36:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:36:37,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-11-29 19:36:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:37,443 INFO L225 Difference]: With dead ends: 873 [2020-11-29 19:36:37,443 INFO L226 Difference]: Without dead ends: 873 [2020-11-29 19:36:37,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:36:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-11-29 19:36:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 820. [2020-11-29 19:36:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-11-29 19:36:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1104 transitions. [2020-11-29 19:36:37,472 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1104 transitions. Word has length 40 [2020-11-29 19:36:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:37,473 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1104 transitions. [2020-11-29 19:36:37,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:36:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1104 transitions. [2020-11-29 19:36:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 19:36:37,475 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:37,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:37,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:36:37,476 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash -746236693, now seen corresponding path program 1 times [2020-11-29 19:36:37,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:37,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294962355] [2020-11-29 19:36:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:37,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:37,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:37,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:37,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 19:36:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:37,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:36:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:37,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294962355] [2020-11-29 19:36:37,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:37,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:36:37,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785877338] [2020-11-29 19:36:37,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:36:37,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:37,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:36:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:36:37,924 INFO L87 Difference]: Start difference. First operand 820 states and 1104 transitions. Second operand 12 states. [2020-11-29 19:36:38,108 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:36:38,256 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:36:39,347 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2020-11-29 19:36:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:40,316 INFO L93 Difference]: Finished difference Result 873 states and 1171 transitions. [2020-11-29 19:36:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:36:40,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-11-29 19:36:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:40,322 INFO L225 Difference]: With dead ends: 873 [2020-11-29 19:36:40,322 INFO L226 Difference]: Without dead ends: 873 [2020-11-29 19:36:40,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:36:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-11-29 19:36:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 820. [2020-11-29 19:36:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-11-29 19:36:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1103 transitions. [2020-11-29 19:36:40,350 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1103 transitions. Word has length 42 [2020-11-29 19:36:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:40,350 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1103 transitions. [2020-11-29 19:36:40,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:36:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1103 transitions. [2020-11-29 19:36:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-29 19:36:40,352 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:40,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:40,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:36:40,352 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:40,353 INFO L82 PathProgramCache]: Analyzing trace with hash 930951193, now seen corresponding path program 1 times [2020-11-29 19:36:40,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:40,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145198363] [2020-11-29 19:36:40,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:40,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:40,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:40,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:40,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 19:36:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:40,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:36:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:40,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145198363] [2020-11-29 19:36:40,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:40,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:36:40,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398226208] [2020-11-29 19:36:40,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:36:40,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:36:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:36:40,668 INFO L87 Difference]: Start difference. First operand 820 states and 1103 transitions. Second operand 10 states. [2020-11-29 19:36:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:42,559 INFO L93 Difference]: Finished difference Result 880 states and 1178 transitions. [2020-11-29 19:36:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:36:42,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-11-29 19:36:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:42,565 INFO L225 Difference]: With dead ends: 880 [2020-11-29 19:36:42,565 INFO L226 Difference]: Without dead ends: 868 [2020-11-29 19:36:42,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:36:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2020-11-29 19:36:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 818. [2020-11-29 19:36:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2020-11-29 19:36:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1099 transitions. [2020-11-29 19:36:42,594 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1099 transitions. Word has length 43 [2020-11-29 19:36:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:42,594 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1099 transitions. [2020-11-29 19:36:42,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:36:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1099 transitions. [2020-11-29 19:36:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 19:36:42,596 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:42,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:42,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 19:36:42,596 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash -327039143, now seen corresponding path program 1 times [2020-11-29 19:36:42,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:42,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926929203] [2020-11-29 19:36:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:42,802 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:42,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:42,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:42,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:42,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 19:36:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:42,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:36:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:42,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926929203] [2020-11-29 19:36:42,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:42,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:36:42,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504891567] [2020-11-29 19:36:42,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:36:42,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:42,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:36:42,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:36:42,955 INFO L87 Difference]: Start difference. First operand 818 states and 1099 transitions. Second operand 10 states. [2020-11-29 19:36:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:45,268 INFO L93 Difference]: Finished difference Result 878 states and 1174 transitions. [2020-11-29 19:36:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:36:45,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-11-29 19:36:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:45,277 INFO L225 Difference]: With dead ends: 878 [2020-11-29 19:36:45,277 INFO L226 Difference]: Without dead ends: 861 [2020-11-29 19:36:45,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:36:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-11-29 19:36:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 811. [2020-11-29 19:36:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2020-11-29 19:36:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1090 transitions. [2020-11-29 19:36:45,306 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1090 transitions. Word has length 42 [2020-11-29 19:36:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:45,307 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1090 transitions. [2020-11-29 19:36:45,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:36:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1090 transitions. [2020-11-29 19:36:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-29 19:36:45,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:45,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:45,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 19:36:45,309 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1584502113, now seen corresponding path program 1 times [2020-11-29 19:36:45,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:45,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208931376] [2020-11-29 19:36:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:45,495 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:45,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:45,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:45,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:45,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:36:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:45,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208931376] [2020-11-29 19:36:45,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:45,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:36:45,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008006415] [2020-11-29 19:36:45,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:36:45,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:36:45,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:36:45,631 INFO L87 Difference]: Start difference. First operand 811 states and 1090 transitions. Second operand 8 states. [2020-11-29 19:36:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:47,513 INFO L93 Difference]: Finished difference Result 836 states and 1119 transitions. [2020-11-29 19:36:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:36:47,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-29 19:36:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:47,517 INFO L225 Difference]: With dead ends: 836 [2020-11-29 19:36:47,517 INFO L226 Difference]: Without dead ends: 836 [2020-11-29 19:36:47,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:36:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-11-29 19:36:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 813. [2020-11-29 19:36:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2020-11-29 19:36:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1092 transitions. [2020-11-29 19:36:47,543 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1092 transitions. Word has length 43 [2020-11-29 19:36:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:47,543 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1092 transitions. [2020-11-29 19:36:47,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:36:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1092 transitions. [2020-11-29 19:36:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-29 19:36:47,545 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:47,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:47,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 19:36:47,545 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1016972866, now seen corresponding path program 1 times [2020-11-29 19:36:47,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:47,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169813280] [2020-11-29 19:36:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:47,751 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:47,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:47,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:47,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:47,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-29 19:36:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:47,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169813280] [2020-11-29 19:36:47,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:47,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 19:36:47,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513986634] [2020-11-29 19:36:47,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:36:47,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:36:47,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:36:47,902 INFO L87 Difference]: Start difference. First operand 813 states and 1092 transitions. Second operand 9 states. [2020-11-29 19:36:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:49,987 INFO L93 Difference]: Finished difference Result 841 states and 1125 transitions. [2020-11-29 19:36:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:36:49,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-11-29 19:36:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:49,991 INFO L225 Difference]: With dead ends: 841 [2020-11-29 19:36:49,991 INFO L226 Difference]: Without dead ends: 841 [2020-11-29 19:36:49,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:36:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2020-11-29 19:36:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 817. [2020-11-29 19:36:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2020-11-29 19:36:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1097 transitions. [2020-11-29 19:36:50,018 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1097 transitions. Word has length 45 [2020-11-29 19:36:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:50,018 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1097 transitions. [2020-11-29 19:36:50,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:36:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1097 transitions. [2020-11-29 19:36:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-29 19:36:50,020 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:50,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:50,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 19:36:50,020 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:50,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1925546386, now seen corresponding path program 1 times [2020-11-29 19:36:50,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:50,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909640115] [2020-11-29 19:36:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:50,188 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:50,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:50,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:50,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:50,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:36:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:50,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909640115] [2020-11-29 19:36:50,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:50,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:36:50,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864730612] [2020-11-29 19:36:50,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:36:50,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:50,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:36:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:36:50,352 INFO L87 Difference]: Start difference. First operand 817 states and 1097 transitions. Second operand 8 states. [2020-11-29 19:36:50,672 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:36:50,862 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-29 19:36:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:51,971 INFO L93 Difference]: Finished difference Result 839 states and 1122 transitions. [2020-11-29 19:36:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:36:51,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-11-29 19:36:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:51,975 INFO L225 Difference]: With dead ends: 839 [2020-11-29 19:36:51,975 INFO L226 Difference]: Without dead ends: 839 [2020-11-29 19:36:51,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:36:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-11-29 19:36:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 817. [2020-11-29 19:36:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2020-11-29 19:36:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1097 transitions. [2020-11-29 19:36:52,003 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1097 transitions. Word has length 44 [2020-11-29 19:36:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:52,004 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1097 transitions. [2020-11-29 19:36:52,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:36:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1097 transitions. [2020-11-29 19:36:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 19:36:52,006 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:52,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:52,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 19:36:52,006 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:52,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:52,007 INFO L82 PathProgramCache]: Analyzing trace with hash 93638672, now seen corresponding path program 1 times [2020-11-29 19:36:52,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:52,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106932370] [2020-11-29 19:36:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:52,192 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:52,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:52,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:52,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:52,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:36:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:52,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 19:36:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:52,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106932370] [2020-11-29 19:36:52,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:52,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:36:52,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3072735] [2020-11-29 19:36:52,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:36:52,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:36:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:36:52,405 INFO L87 Difference]: Start difference. First operand 817 states and 1097 transitions. Second operand 10 states. [2020-11-29 19:36:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:53,952 INFO L93 Difference]: Finished difference Result 859 states and 1147 transitions. [2020-11-29 19:36:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:36:53,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-11-29 19:36:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:53,957 INFO L225 Difference]: With dead ends: 859 [2020-11-29 19:36:53,957 INFO L226 Difference]: Without dead ends: 844 [2020-11-29 19:36:53,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:36:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2020-11-29 19:36:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 815. [2020-11-29 19:36:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2020-11-29 19:36:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1093 transitions. [2020-11-29 19:36:53,983 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1093 transitions. Word has length 46 [2020-11-29 19:36:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:53,984 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 1093 transitions. [2020-11-29 19:36:53,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:36:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1093 transitions. [2020-11-29 19:36:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-29 19:36:53,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:53,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:53,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 19:36:53,986 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash -164132335, now seen corresponding path program 1 times [2020-11-29 19:36:53,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:53,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091090541] [2020-11-29 19:36:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:54,181 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:54,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:54,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:54,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:54,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:36:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:54,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 19:36:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:54,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091090541] [2020-11-29 19:36:54,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:54,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:36:54,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749684679] [2020-11-29 19:36:54,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:36:54,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:36:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:36:54,372 INFO L87 Difference]: Start difference. First operand 815 states and 1093 transitions. Second operand 8 states. [2020-11-29 19:36:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:56,167 INFO L93 Difference]: Finished difference Result 857 states and 1138 transitions. [2020-11-29 19:36:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:36:56,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-11-29 19:36:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:56,172 INFO L225 Difference]: With dead ends: 857 [2020-11-29 19:36:56,172 INFO L226 Difference]: Without dead ends: 806 [2020-11-29 19:36:56,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:36:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-11-29 19:36:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 776. [2020-11-29 19:36:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-11-29 19:36:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1042 transitions. [2020-11-29 19:36:56,207 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1042 transitions. Word has length 47 [2020-11-29 19:36:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:56,208 INFO L481 AbstractCegarLoop]: Abstraction has 776 states and 1042 transitions. [2020-11-29 19:36:56,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:36:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1042 transitions. [2020-11-29 19:36:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 19:36:56,209 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:56,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:56,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 19:36:56,210 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:56,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash 82248070, now seen corresponding path program 1 times [2020-11-29 19:36:56,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:56,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601239647] [2020-11-29 19:36:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:56,370 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:56,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:56,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:56,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:56,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-29 19:36:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:56,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601239647] [2020-11-29 19:36:56,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:56,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 19:36:56,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833080827] [2020-11-29 19:36:56,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:36:56,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:36:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:36:56,487 INFO L87 Difference]: Start difference. First operand 776 states and 1042 transitions. Second operand 7 states. [2020-11-29 19:36:57,340 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:36:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:36:58,870 INFO L93 Difference]: Finished difference Result 1133 states and 1530 transitions. [2020-11-29 19:36:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:36:58,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-11-29 19:36:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:36:58,876 INFO L225 Difference]: With dead ends: 1133 [2020-11-29 19:36:58,877 INFO L226 Difference]: Without dead ends: 1133 [2020-11-29 19:36:58,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:36:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-11-29 19:36:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 889. [2020-11-29 19:36:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2020-11-29 19:36:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1196 transitions. [2020-11-29 19:36:58,911 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1196 transitions. Word has length 48 [2020-11-29 19:36:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:36:58,911 INFO L481 AbstractCegarLoop]: Abstraction has 889 states and 1196 transitions. [2020-11-29 19:36:58,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:36:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1196 transitions. [2020-11-29 19:36:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 19:36:58,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:36:58,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:36:58,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 19:36:58,914 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:36:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:36:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash -26787835, now seen corresponding path program 1 times [2020-11-29 19:36:58,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:36:58,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175199058] [2020-11-29 19:36:58,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:36:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:59,089 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:36:59,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:36:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:59,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:36:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:59,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:36:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:59,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:36:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:59,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:36:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:36:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:36:59,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175199058] [2020-11-29 19:36:59,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:36:59,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:36:59,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335772399] [2020-11-29 19:36:59,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:36:59,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:36:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:36:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:36:59,280 INFO L87 Difference]: Start difference. First operand 889 states and 1196 transitions. Second operand 10 states. [2020-11-29 19:37:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:00,553 INFO L93 Difference]: Finished difference Result 931 states and 1246 transitions. [2020-11-29 19:37:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:37:00,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-11-29 19:37:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:00,558 INFO L225 Difference]: With dead ends: 931 [2020-11-29 19:37:00,559 INFO L226 Difference]: Without dead ends: 916 [2020-11-29 19:37:00,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:37:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-11-29 19:37:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 887. [2020-11-29 19:37:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2020-11-29 19:37:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1192 transitions. [2020-11-29 19:37:00,584 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1192 transitions. Word has length 48 [2020-11-29 19:37:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:00,585 INFO L481 AbstractCegarLoop]: Abstraction has 887 states and 1192 transitions. [2020-11-29 19:37:00,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:37:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1192 transitions. [2020-11-29 19:37:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 19:37:00,586 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:00,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:00,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 19:37:00,587 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash -535604418, now seen corresponding path program 1 times [2020-11-29 19:37:00,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:00,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314192299] [2020-11-29 19:37:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:00,798 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:00,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:00,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:00,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:00,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-29 19:37:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:00,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314192299] [2020-11-29 19:37:00,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:00,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:37:00,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402610829] [2020-11-29 19:37:00,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:37:00,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:37:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:37:00,968 INFO L87 Difference]: Start difference. First operand 887 states and 1192 transitions. Second operand 10 states. [2020-11-29 19:37:01,172 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-11-29 19:37:01,601 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 19:37:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:04,284 INFO L93 Difference]: Finished difference Result 938 states and 1239 transitions. [2020-11-29 19:37:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:04,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2020-11-29 19:37:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:04,288 INFO L225 Difference]: With dead ends: 938 [2020-11-29 19:37:04,288 INFO L226 Difference]: Without dead ends: 938 [2020-11-29 19:37:04,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2020-11-29 19:37:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2020-11-29 19:37:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 878. [2020-11-29 19:37:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-11-29 19:37:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1171 transitions. [2020-11-29 19:37:04,312 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1171 transitions. Word has length 49 [2020-11-29 19:37:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:04,313 INFO L481 AbstractCegarLoop]: Abstraction has 878 states and 1171 transitions. [2020-11-29 19:37:04,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:37:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1171 transitions. [2020-11-29 19:37:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 19:37:04,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:04,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:04,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 19:37:04,315 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:04,316 INFO L82 PathProgramCache]: Analyzing trace with hash 992511745, now seen corresponding path program 1 times [2020-11-29 19:37:04,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:04,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520345976] [2020-11-29 19:37:04,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:04,523 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:04,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:04,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:04,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:04,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:04,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:04,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520345976] [2020-11-29 19:37:04,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:04,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:37:04,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666591657] [2020-11-29 19:37:04,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:04,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:04,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:04,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:04,758 INFO L87 Difference]: Start difference. First operand 878 states and 1171 transitions. Second operand 12 states. [2020-11-29 19:37:04,983 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-29 19:37:05,195 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:37:05,763 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 19:37:05,987 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-29 19:37:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:08,523 INFO L93 Difference]: Finished difference Result 1076 states and 1433 transitions. [2020-11-29 19:37:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-29 19:37:08,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2020-11-29 19:37:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:08,529 INFO L225 Difference]: With dead ends: 1076 [2020-11-29 19:37:08,529 INFO L226 Difference]: Without dead ends: 1076 [2020-11-29 19:37:08,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2020-11-29 19:37:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2020-11-29 19:37:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 933. [2020-11-29 19:37:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2020-11-29 19:37:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1244 transitions. [2020-11-29 19:37:08,557 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1244 transitions. Word has length 51 [2020-11-29 19:37:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:08,557 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1244 transitions. [2020-11-29 19:37:08,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1244 transitions. [2020-11-29 19:37:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 19:37:08,559 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:08,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:08,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 19:37:08,560 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:08,560 INFO L82 PathProgramCache]: Analyzing trace with hash 319901188, now seen corresponding path program 1 times [2020-11-29 19:37:08,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:08,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090489065] [2020-11-29 19:37:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:08,755 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:08,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:08,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:08,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:08,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:08,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 19:37:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:08,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090489065] [2020-11-29 19:37:08,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:08,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 19:37:08,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082169348] [2020-11-29 19:37:08,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 19:37:08,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:08,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:37:08,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:08,929 INFO L87 Difference]: Start difference. First operand 933 states and 1244 transitions. Second operand 11 states. [2020-11-29 19:37:09,233 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-29 19:37:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:10,529 INFO L93 Difference]: Finished difference Result 977 states and 1294 transitions. [2020-11-29 19:37:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:10,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2020-11-29 19:37:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:10,533 INFO L225 Difference]: With dead ends: 977 [2020-11-29 19:37:10,533 INFO L226 Difference]: Without dead ends: 960 [2020-11-29 19:37:10,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2020-11-29 19:37:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 933. [2020-11-29 19:37:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2020-11-29 19:37:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1232 transitions. [2020-11-29 19:37:10,557 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1232 transitions. Word has length 51 [2020-11-29 19:37:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:10,558 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1232 transitions. [2020-11-29 19:37:10,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 19:37:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1232 transitions. [2020-11-29 19:37:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 19:37:10,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:10,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:10,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 19:37:10,560 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash -949504265, now seen corresponding path program 1 times [2020-11-29 19:37:10,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:10,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341902071] [2020-11-29 19:37:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:10,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:10,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:10,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:10,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 19:37:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:10,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341902071] [2020-11-29 19:37:10,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:10,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:37:10,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635626128] [2020-11-29 19:37:10,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:37:10,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:37:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:37:10,852 INFO L87 Difference]: Start difference. First operand 933 states and 1232 transitions. Second operand 8 states. [2020-11-29 19:37:11,518 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:37:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:12,995 INFO L93 Difference]: Finished difference Result 687 states and 871 transitions. [2020-11-29 19:37:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:37:12,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-11-29 19:37:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:13,000 INFO L225 Difference]: With dead ends: 687 [2020-11-29 19:37:13,000 INFO L226 Difference]: Without dead ends: 687 [2020-11-29 19:37:13,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:37:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-11-29 19:37:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 624. [2020-11-29 19:37:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2020-11-29 19:37:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2020-11-29 19:37:13,016 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 53 [2020-11-29 19:37:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:13,016 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2020-11-29 19:37:13,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:37:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2020-11-29 19:37:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 19:37:13,018 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:13,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:13,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 19:37:13,018 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:13,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:13,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1680705227, now seen corresponding path program 1 times [2020-11-29 19:37:13,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:13,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352824864] [2020-11-29 19:37:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,209 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:13,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:37:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:13,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352824864] [2020-11-29 19:37:13,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:13,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 19:37:13,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799576141] [2020-11-29 19:37:13,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 19:37:13,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:13,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:37:13,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:13,428 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand 11 states. [2020-11-29 19:37:13,816 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-29 19:37:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:15,522 INFO L93 Difference]: Finished difference Result 671 states and 846 transitions. [2020-11-29 19:37:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:15,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-11-29 19:37:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:15,525 INFO L225 Difference]: With dead ends: 671 [2020-11-29 19:37:15,525 INFO L226 Difference]: Without dead ends: 646 [2020-11-29 19:37:15,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:37:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-11-29 19:37:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 614. [2020-11-29 19:37:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2020-11-29 19:37:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 777 transitions. [2020-11-29 19:37:15,540 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 777 transitions. Word has length 52 [2020-11-29 19:37:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:15,540 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 777 transitions. [2020-11-29 19:37:15,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 19:37:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 777 transitions. [2020-11-29 19:37:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 19:37:15,542 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:15,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:15,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 19:37:15,542 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1227138149, now seen corresponding path program 1 times [2020-11-29 19:37:15,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:15,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547858368] [2020-11-29 19:37:15,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,692 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:15,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:37:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:15,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547858368] [2020-11-29 19:37:15,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:15,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 19:37:15,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138513793] [2020-11-29 19:37:15,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 19:37:15,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:37:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:15,927 INFO L87 Difference]: Start difference. First operand 614 states and 777 transitions. Second operand 11 states. [2020-11-29 19:37:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:17,961 INFO L93 Difference]: Finished difference Result 648 states and 818 transitions. [2020-11-29 19:37:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:37:17,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-11-29 19:37:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:17,964 INFO L225 Difference]: With dead ends: 648 [2020-11-29 19:37:17,964 INFO L226 Difference]: Without dead ends: 648 [2020-11-29 19:37:17,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:37:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-11-29 19:37:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 617. [2020-11-29 19:37:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2020-11-29 19:37:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 780 transitions. [2020-11-29 19:37:17,979 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 780 transitions. Word has length 52 [2020-11-29 19:37:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:17,980 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 780 transitions. [2020-11-29 19:37:17,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 19:37:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 780 transitions. [2020-11-29 19:37:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 19:37:17,981 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:17,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:17,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 19:37:17,982 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1667968644, now seen corresponding path program 1 times [2020-11-29 19:37:17,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:17,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921358537] [2020-11-29 19:37:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,145 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:18,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:18,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921358537] [2020-11-29 19:37:18,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:18,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:37:18,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234466713] [2020-11-29 19:37:18,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:37:18,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:37:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:37:18,296 INFO L87 Difference]: Start difference. First operand 617 states and 780 transitions. Second operand 8 states. [2020-11-29 19:37:18,427 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 19:37:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:19,495 INFO L93 Difference]: Finished difference Result 852 states and 1094 transitions. [2020-11-29 19:37:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:37:19,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-11-29 19:37:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:19,500 INFO L225 Difference]: With dead ends: 852 [2020-11-29 19:37:19,500 INFO L226 Difference]: Without dead ends: 834 [2020-11-29 19:37:19,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:37:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-11-29 19:37:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 660. [2020-11-29 19:37:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2020-11-29 19:37:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 834 transitions. [2020-11-29 19:37:19,518 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 834 transitions. Word has length 53 [2020-11-29 19:37:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:19,518 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 834 transitions. [2020-11-29 19:37:19,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:37:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 834 transitions. [2020-11-29 19:37:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 19:37:19,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:19,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:19,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 19:37:19,521 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1814661446, now seen corresponding path program 1 times [2020-11-29 19:37:19,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:19,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949355579] [2020-11-29 19:37:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,717 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:19,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:19,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949355579] [2020-11-29 19:37:19,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:19,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:37:19,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067949420] [2020-11-29 19:37:19,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:19,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:19,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:19,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:19,925 INFO L87 Difference]: Start difference. First operand 660 states and 834 transitions. Second operand 12 states. [2020-11-29 19:37:20,208 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2020-11-29 19:37:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:22,549 INFO L93 Difference]: Finished difference Result 647 states and 815 transitions. [2020-11-29 19:37:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:37:22,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2020-11-29 19:37:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:22,552 INFO L225 Difference]: With dead ends: 647 [2020-11-29 19:37:22,552 INFO L226 Difference]: Without dead ends: 603 [2020-11-29 19:37:22,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2020-11-29 19:37:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-11-29 19:37:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 570. [2020-11-29 19:37:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-11-29 19:37:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 722 transitions. [2020-11-29 19:37:22,565 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 722 transitions. Word has length 53 [2020-11-29 19:37:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:22,565 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 722 transitions. [2020-11-29 19:37:22,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 722 transitions. [2020-11-29 19:37:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 19:37:22,567 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:22,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:22,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 19:37:22,568 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash 956869472, now seen corresponding path program 1 times [2020-11-29 19:37:22,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:22,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901718593] [2020-11-29 19:37:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,732 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:22,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:22,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901718593] [2020-11-29 19:37:22,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:22,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 19:37:22,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923130248] [2020-11-29 19:37:22,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 19:37:22,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:22,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:37:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:37:22,973 INFO L87 Difference]: Start difference. First operand 570 states and 722 transitions. Second operand 13 states. [2020-11-29 19:37:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:24,848 INFO L93 Difference]: Finished difference Result 601 states and 758 transitions. [2020-11-29 19:37:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:24,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2020-11-29 19:37:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:24,854 INFO L225 Difference]: With dead ends: 601 [2020-11-29 19:37:24,854 INFO L226 Difference]: Without dead ends: 600 [2020-11-29 19:37:24,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-11-29 19:37:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 578. [2020-11-29 19:37:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-11-29 19:37:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 730 transitions. [2020-11-29 19:37:24,875 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 730 transitions. Word has length 54 [2020-11-29 19:37:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:24,876 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 730 transitions. [2020-11-29 19:37:24,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 19:37:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 730 transitions. [2020-11-29 19:37:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 19:37:24,877 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:24,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:24,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 19:37:24,878 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash 948287742, now seen corresponding path program 1 times [2020-11-29 19:37:24,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:24,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511364637] [2020-11-29 19:37:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:25,106 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:25,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:25,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:25,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:25,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:25,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:25,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511364637] [2020-11-29 19:37:25,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:25,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:37:25,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781699427] [2020-11-29 19:37:25,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:37:25,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:25,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:37:25,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:37:25,292 INFO L87 Difference]: Start difference. First operand 578 states and 730 transitions. Second operand 10 states. [2020-11-29 19:37:25,480 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 19:37:25,709 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:37:27,265 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 19:37:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:28,205 INFO L93 Difference]: Finished difference Result 742 states and 956 transitions. [2020-11-29 19:37:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:37:28,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2020-11-29 19:37:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:28,210 INFO L225 Difference]: With dead ends: 742 [2020-11-29 19:37:28,210 INFO L226 Difference]: Without dead ends: 728 [2020-11-29 19:37:28,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:37:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-11-29 19:37:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 568. [2020-11-29 19:37:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2020-11-29 19:37:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 718 transitions. [2020-11-29 19:37:28,225 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 718 transitions. Word has length 54 [2020-11-29 19:37:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:28,225 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 718 transitions. [2020-11-29 19:37:28,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:37:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 718 transitions. [2020-11-29 19:37:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 19:37:28,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:28,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:28,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 19:37:28,228 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -152117373, now seen corresponding path program 1 times [2020-11-29 19:37:28,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:28,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564613268] [2020-11-29 19:37:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:28,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:28,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:28,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:28,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:28,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 19:37:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:28,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 19:37:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:28,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564613268] [2020-11-29 19:37:28,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:28,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:37:28,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764582346] [2020-11-29 19:37:28,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:37:28,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:37:28,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:28,647 INFO L87 Difference]: Start difference. First operand 568 states and 718 transitions. Second operand 14 states. [2020-11-29 19:37:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:30,474 INFO L93 Difference]: Finished difference Result 600 states and 754 transitions. [2020-11-29 19:37:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:37:30,475 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2020-11-29 19:37:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:30,477 INFO L225 Difference]: With dead ends: 600 [2020-11-29 19:37:30,477 INFO L226 Difference]: Without dead ends: 575 [2020-11-29 19:37:30,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:37:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-11-29 19:37:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 556. [2020-11-29 19:37:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2020-11-29 19:37:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 702 transitions. [2020-11-29 19:37:30,495 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 702 transitions. Word has length 56 [2020-11-29 19:37:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:30,495 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 702 transitions. [2020-11-29 19:37:30,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:37:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 702 transitions. [2020-11-29 19:37:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-29 19:37:30,497 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:30,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:30,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-29 19:37:30,497 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 905671385, now seen corresponding path program 1 times [2020-11-29 19:37:30,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:30,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374764072] [2020-11-29 19:37:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,756 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:30,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-29 19:37:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:37:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-29 19:37:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:30,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374764072] [2020-11-29 19:37:30,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:30,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:37:30,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104340402] [2020-11-29 19:37:30,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:37:30,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:37:30,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:37:30,880 INFO L87 Difference]: Start difference. First operand 556 states and 702 transitions. Second operand 8 states. [2020-11-29 19:37:31,047 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 19:37:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:32,440 INFO L93 Difference]: Finished difference Result 584 states and 738 transitions. [2020-11-29 19:37:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:37:32,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2020-11-29 19:37:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:32,442 INFO L225 Difference]: With dead ends: 584 [2020-11-29 19:37:32,442 INFO L226 Difference]: Without dead ends: 584 [2020-11-29 19:37:32,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-11-29 19:37:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 561. [2020-11-29 19:37:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-11-29 19:37:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 709 transitions. [2020-11-29 19:37:32,454 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 709 transitions. Word has length 59 [2020-11-29 19:37:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:32,454 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 709 transitions. [2020-11-29 19:37:32,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:37:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 709 transitions. [2020-11-29 19:37:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 19:37:32,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:32,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:32,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-29 19:37:32,457 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash -245780420, now seen corresponding path program 1 times [2020-11-29 19:37:32,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:32,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433639619] [2020-11-29 19:37:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,657 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:32,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-29 19:37:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:37:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:37:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:32,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433639619] [2020-11-29 19:37:32,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:32,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:37:32,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205416200] [2020-11-29 19:37:32,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:37:32,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:37:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:37:32,890 INFO L87 Difference]: Start difference. First operand 561 states and 709 transitions. Second operand 10 states. [2020-11-29 19:37:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:34,682 INFO L93 Difference]: Finished difference Result 536 states and 672 transitions. [2020-11-29 19:37:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:37:34,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-11-29 19:37:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:34,685 INFO L225 Difference]: With dead ends: 536 [2020-11-29 19:37:34,685 INFO L226 Difference]: Without dead ends: 536 [2020-11-29 19:37:34,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:37:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-11-29 19:37:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 509. [2020-11-29 19:37:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2020-11-29 19:37:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 636 transitions. [2020-11-29 19:37:34,695 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 636 transitions. Word has length 65 [2020-11-29 19:37:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:34,695 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 636 transitions. [2020-11-29 19:37:34,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:37:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 636 transitions. [2020-11-29 19:37:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-29 19:37:34,697 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:34,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:34,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-29 19:37:34,698 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -296281848, now seen corresponding path program 1 times [2020-11-29 19:37:34,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:34,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805941690] [2020-11-29 19:37:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:34,908 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:34,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:34,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:34,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:35,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:35,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:37:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:35,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-29 19:37:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:35,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805941690] [2020-11-29 19:37:35,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:35,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:37:35,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862240642] [2020-11-29 19:37:35,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:37:35,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:35,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:37:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:35,154 INFO L87 Difference]: Start difference. First operand 509 states and 636 transitions. Second operand 14 states. [2020-11-29 19:37:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:37,338 INFO L93 Difference]: Finished difference Result 540 states and 672 transitions. [2020-11-29 19:37:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:37:37,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2020-11-29 19:37:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:37,340 INFO L225 Difference]: With dead ends: 540 [2020-11-29 19:37:37,340 INFO L226 Difference]: Without dead ends: 522 [2020-11-29 19:37:37,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:37:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-11-29 19:37:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 506. [2020-11-29 19:37:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-11-29 19:37:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 632 transitions. [2020-11-29 19:37:37,351 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 632 transitions. Word has length 60 [2020-11-29 19:37:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:37,351 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 632 transitions. [2020-11-29 19:37:37,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:37:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 632 transitions. [2020-11-29 19:37:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-29 19:37:37,353 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:37,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:37,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-29 19:37:37,353 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:37,354 INFO L82 PathProgramCache]: Analyzing trace with hash 437218548, now seen corresponding path program 1 times [2020-11-29 19:37:37,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:37,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246153013] [2020-11-29 19:37:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:37,534 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:37,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:37,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:37,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:37,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:37:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:37,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 19:37:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:37,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246153013] [2020-11-29 19:37:37,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:37,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 19:37:37,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584898291] [2020-11-29 19:37:37,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 19:37:37,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:37,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:37:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:37:37,795 INFO L87 Difference]: Start difference. First operand 506 states and 632 transitions. Second operand 13 states. [2020-11-29 19:37:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:39,775 INFO L93 Difference]: Finished difference Result 533 states and 663 transitions. [2020-11-29 19:37:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:37:39,776 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2020-11-29 19:37:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:39,777 INFO L225 Difference]: With dead ends: 533 [2020-11-29 19:37:39,777 INFO L226 Difference]: Without dead ends: 518 [2020-11-29 19:37:39,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-11-29 19:37:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 502. [2020-11-29 19:37:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2020-11-29 19:37:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 626 transitions. [2020-11-29 19:37:39,787 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 626 transitions. Word has length 59 [2020-11-29 19:37:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:39,787 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 626 transitions. [2020-11-29 19:37:39,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 19:37:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 626 transitions. [2020-11-29 19:37:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:37:39,789 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:39,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:39,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-29 19:37:39,790 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1524010902, now seen corresponding path program 1 times [2020-11-29 19:37:39,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:39,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773902016] [2020-11-29 19:37:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:39,986 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:39,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:40,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:40,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:40,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:37:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:40,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 19:37:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:40,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 19:37:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:40,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773902016] [2020-11-29 19:37:40,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:40,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:37:40,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881900188] [2020-11-29 19:37:40,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:40,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:40,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:40,212 INFO L87 Difference]: Start difference. First operand 502 states and 626 transitions. Second operand 12 states. [2020-11-29 19:37:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:41,977 INFO L93 Difference]: Finished difference Result 534 states and 663 transitions. [2020-11-29 19:37:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:41,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-11-29 19:37:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:41,979 INFO L225 Difference]: With dead ends: 534 [2020-11-29 19:37:41,980 INFO L226 Difference]: Without dead ends: 513 [2020-11-29 19:37:41,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:37:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-11-29 19:37:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 497. [2020-11-29 19:37:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-11-29 19:37:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 618 transitions. [2020-11-29 19:37:41,988 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 618 transitions. Word has length 61 [2020-11-29 19:37:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:41,989 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 618 transitions. [2020-11-29 19:37:41,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 618 transitions. [2020-11-29 19:37:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-29 19:37:41,991 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:41,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:41,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-29 19:37:41,991 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2072718475, now seen corresponding path program 1 times [2020-11-29 19:37:41,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:41,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652560328] [2020-11-29 19:37:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,179 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:42,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-29 19:37:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:37:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:37:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:37:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:42,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652560328] [2020-11-29 19:37:42,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:42,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:37:42,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370763679] [2020-11-29 19:37:42,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:42,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:42,427 INFO L87 Difference]: Start difference. First operand 497 states and 618 transitions. Second operand 12 states. [2020-11-29 19:37:42,642 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-29 19:37:42,847 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:37:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:44,579 INFO L93 Difference]: Finished difference Result 519 states and 647 transitions. [2020-11-29 19:37:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:37:44,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2020-11-29 19:37:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:44,581 INFO L225 Difference]: With dead ends: 519 [2020-11-29 19:37:44,581 INFO L226 Difference]: Without dead ends: 519 [2020-11-29 19:37:44,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:37:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-11-29 19:37:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 497. [2020-11-29 19:37:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-11-29 19:37:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 617 transitions. [2020-11-29 19:37:44,592 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 617 transitions. Word has length 69 [2020-11-29 19:37:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:44,592 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 617 transitions. [2020-11-29 19:37:44,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 617 transitions. [2020-11-29 19:37:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 19:37:44,595 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:44,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:44,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-29 19:37:44,596 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1943853857, now seen corresponding path program 1 times [2020-11-29 19:37:44,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:44,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107249990] [2020-11-29 19:37:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:44,807 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:44,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:44,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:44,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:44,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:44,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:37:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:45,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:37:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:45,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107249990] [2020-11-29 19:37:45,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:45,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:37:45,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069378719] [2020-11-29 19:37:45,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:37:45,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:45,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:37:45,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:37:45,038 INFO L87 Difference]: Start difference. First operand 497 states and 617 transitions. Second operand 10 states. [2020-11-29 19:37:45,814 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-29 19:37:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:47,159 INFO L93 Difference]: Finished difference Result 517 states and 642 transitions. [2020-11-29 19:37:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:37:47,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2020-11-29 19:37:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:47,162 INFO L225 Difference]: With dead ends: 517 [2020-11-29 19:37:47,162 INFO L226 Difference]: Without dead ends: 517 [2020-11-29 19:37:47,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:37:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-11-29 19:37:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 501. [2020-11-29 19:37:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2020-11-29 19:37:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 621 transitions. [2020-11-29 19:37:47,192 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 621 transitions. Word has length 64 [2020-11-29 19:37:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:47,192 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 621 transitions. [2020-11-29 19:37:47,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:37:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 621 transitions. [2020-11-29 19:37:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 19:37:47,195 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:47,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:47,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-29 19:37:47,196 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash 10393984, now seen corresponding path program 1 times [2020-11-29 19:37:47,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:47,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200325981] [2020-11-29 19:37:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,389 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:47,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:37:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:37:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:47,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200325981] [2020-11-29 19:37:47,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:47,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:37:47,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016956345] [2020-11-29 19:37:47,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:47,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:47,606 INFO L87 Difference]: Start difference. First operand 501 states and 621 transitions. Second operand 12 states. [2020-11-29 19:37:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:50,037 INFO L93 Difference]: Finished difference Result 503 states and 623 transitions. [2020-11-29 19:37:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:50,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-11-29 19:37:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:50,059 INFO L225 Difference]: With dead ends: 503 [2020-11-29 19:37:50,060 INFO L226 Difference]: Without dead ends: 503 [2020-11-29 19:37:50,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-11-29 19:37:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-11-29 19:37:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 487. [2020-11-29 19:37:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-11-29 19:37:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 602 transitions. [2020-11-29 19:37:50,071 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 602 transitions. Word has length 64 [2020-11-29 19:37:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:50,072 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 602 transitions. [2020-11-29 19:37:50,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 602 transitions. [2020-11-29 19:37:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-29 19:37:50,074 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:50,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:50,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-29 19:37:50,075 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash -512526758, now seen corresponding path program 1 times [2020-11-29 19:37:50,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:50,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399622692] [2020-11-29 19:37:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,273 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:50,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-29 19:37:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:37:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:37:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:37:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:50,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399622692] [2020-11-29 19:37:50,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:50,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 19:37:50,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109331106] [2020-11-29 19:37:50,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:37:50,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:37:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:37:50,432 INFO L87 Difference]: Start difference. First operand 487 states and 602 transitions. Second operand 9 states. [2020-11-29 19:37:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:51,933 INFO L93 Difference]: Finished difference Result 518 states and 646 transitions. [2020-11-29 19:37:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:37:51,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-11-29 19:37:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:51,937 INFO L225 Difference]: With dead ends: 518 [2020-11-29 19:37:51,937 INFO L226 Difference]: Without dead ends: 518 [2020-11-29 19:37:51,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-11-29 19:37:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 490. [2020-11-29 19:37:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-11-29 19:37:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 605 transitions. [2020-11-29 19:37:51,949 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 605 transitions. Word has length 71 [2020-11-29 19:37:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:51,949 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 605 transitions. [2020-11-29 19:37:51,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:37:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 605 transitions. [2020-11-29 19:37:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 19:37:51,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:51,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:51,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-29 19:37:51,952 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 679655979, now seen corresponding path program 1 times [2020-11-29 19:37:51,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:51,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572816228] [2020-11-29 19:37:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:52,165 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:52,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:52,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:52,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:52,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:37:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:52,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:52,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572816228] [2020-11-29 19:37:52,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:52,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:37:52,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028215233] [2020-11-29 19:37:52,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:37:52,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:37:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:52,436 INFO L87 Difference]: Start difference. First operand 490 states and 605 transitions. Second operand 14 states. [2020-11-29 19:37:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:54,582 INFO L93 Difference]: Finished difference Result 520 states and 640 transitions. [2020-11-29 19:37:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:54,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2020-11-29 19:37:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:54,584 INFO L225 Difference]: With dead ends: 520 [2020-11-29 19:37:54,585 INFO L226 Difference]: Without dead ends: 502 [2020-11-29 19:37:54,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:37:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-11-29 19:37:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 486. [2020-11-29 19:37:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-11-29 19:37:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 599 transitions. [2020-11-29 19:37:54,595 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 599 transitions. Word has length 64 [2020-11-29 19:37:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:54,596 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 599 transitions. [2020-11-29 19:37:54,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:37:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 599 transitions. [2020-11-29 19:37:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-29 19:37:54,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:54,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:54,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-29 19:37:54,598 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1630352941, now seen corresponding path program 1 times [2020-11-29 19:37:54,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:54,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924879059] [2020-11-29 19:37:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:54,818 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:54,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:54,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:54,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:54,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-29 19:37:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:54,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:37:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:54,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:37:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:54,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:37:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:55,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924879059] [2020-11-29 19:37:55,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:55,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 19:37:55,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132208304] [2020-11-29 19:37:55,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:55,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:55,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:55,013 INFO L87 Difference]: Start difference. First operand 486 states and 599 transitions. Second operand 12 states. [2020-11-29 19:37:55,675 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:37:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:57,123 INFO L93 Difference]: Finished difference Result 521 states and 646 transitions. [2020-11-29 19:37:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:37:57,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-11-29 19:37:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:57,125 INFO L225 Difference]: With dead ends: 521 [2020-11-29 19:37:57,125 INFO L226 Difference]: Without dead ends: 521 [2020-11-29 19:37:57,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:37:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-11-29 19:37:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 486. [2020-11-29 19:37:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-11-29 19:37:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 597 transitions. [2020-11-29 19:37:57,135 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 597 transitions. Word has length 72 [2020-11-29 19:37:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:57,135 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 597 transitions. [2020-11-29 19:37:57,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 597 transitions. [2020-11-29 19:37:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 19:37:57,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:57,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:57,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-29 19:37:57,137 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:57,138 INFO L82 PathProgramCache]: Analyzing trace with hash -758331828, now seen corresponding path program 1 times [2020-11-29 19:37:57,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:57,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468787187] [2020-11-29 19:37:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:57,332 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:57,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:57,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:57,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:57,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:37:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:57,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-29 19:37:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:57,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468787187] [2020-11-29 19:37:57,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:57,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 19:37:57,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063265637] [2020-11-29 19:37:57,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 19:37:57,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:37:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:37:57,553 INFO L87 Difference]: Start difference. First operand 486 states and 597 transitions. Second operand 13 states. [2020-11-29 19:37:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:59,387 INFO L93 Difference]: Finished difference Result 510 states and 625 transitions. [2020-11-29 19:37:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:59,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-11-29 19:37:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:59,388 INFO L225 Difference]: With dead ends: 510 [2020-11-29 19:37:59,389 INFO L226 Difference]: Without dead ends: 491 [2020-11-29 19:37:59,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-11-29 19:37:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 475. [2020-11-29 19:37:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2020-11-29 19:37:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 582 transitions. [2020-11-29 19:37:59,396 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 582 transitions. Word has length 65 [2020-11-29 19:37:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:59,397 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 582 transitions. [2020-11-29 19:37:59,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 19:37:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 582 transitions. [2020-11-29 19:37:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 19:37:59,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:59,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:59,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-29 19:37:59,399 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:37:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash -944160230, now seen corresponding path program 1 times [2020-11-29 19:37:59,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:59,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533669899] [2020-11-29 19:37:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:59,601 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:37:59,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:37:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:59,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:37:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:59,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:37:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:59,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:37:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:59,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:37:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:59,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533669899] [2020-11-29 19:37:59,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:59,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:37:59,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38512556] [2020-11-29 19:37:59,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:37:59,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:37:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:59,860 INFO L87 Difference]: Start difference. First operand 475 states and 582 transitions. Second operand 14 states. [2020-11-29 19:38:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:01,879 INFO L93 Difference]: Finished difference Result 505 states and 617 transitions. [2020-11-29 19:38:01,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:38:01,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2020-11-29 19:38:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:01,881 INFO L225 Difference]: With dead ends: 505 [2020-11-29 19:38:01,881 INFO L226 Difference]: Without dead ends: 486 [2020-11-29 19:38:01,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:38:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-11-29 19:38:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 470. [2020-11-29 19:38:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-11-29 19:38:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 575 transitions. [2020-11-29 19:38:01,887 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 575 transitions. Word has length 65 [2020-11-29 19:38:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:01,888 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 575 transitions. [2020-11-29 19:38:01,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:38:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 575 transitions. [2020-11-29 19:38:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 19:38:01,889 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:01,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:01,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-29 19:38:01,890 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash 287155272, now seen corresponding path program 1 times [2020-11-29 19:38:01,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:01,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404494163] [2020-11-29 19:38:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:02,111 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:02,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:02,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:02,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:02,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:02,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:02,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404494163] [2020-11-29 19:38:02,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:02,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:38:02,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810371542] [2020-11-29 19:38:02,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:38:02,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:38:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:38:02,343 INFO L87 Difference]: Start difference. First operand 470 states and 575 transitions. Second operand 14 states. [2020-11-29 19:38:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:04,121 INFO L93 Difference]: Finished difference Result 500 states and 610 transitions. [2020-11-29 19:38:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:38:04,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2020-11-29 19:38:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:04,123 INFO L225 Difference]: With dead ends: 500 [2020-11-29 19:38:04,123 INFO L226 Difference]: Without dead ends: 482 [2020-11-29 19:38:04,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:38:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-11-29 19:38:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2020-11-29 19:38:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-11-29 19:38:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 569 transitions. [2020-11-29 19:38:04,132 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 569 transitions. Word has length 65 [2020-11-29 19:38:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:04,132 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 569 transitions. [2020-11-29 19:38:04,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:38:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 569 transitions. [2020-11-29 19:38:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-29 19:38:04,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:04,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:04,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-29 19:38:04,134 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1195403209, now seen corresponding path program 1 times [2020-11-29 19:38:04,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:04,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455997485] [2020-11-29 19:38:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,327 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:04,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 19:38:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:04,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455997485] [2020-11-29 19:38:04,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:04,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 19:38:04,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687863395] [2020-11-29 19:38:04,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:38:04,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:04,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:38:04,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:38:04,485 INFO L87 Difference]: Start difference. First operand 466 states and 569 transitions. Second operand 9 states. [2020-11-29 19:38:05,145 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:38:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:05,899 INFO L93 Difference]: Finished difference Result 627 states and 763 transitions. [2020-11-29 19:38:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:38:05,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-11-29 19:38:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:05,902 INFO L225 Difference]: With dead ends: 627 [2020-11-29 19:38:05,902 INFO L226 Difference]: Without dead ends: 627 [2020-11-29 19:38:05,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:38:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-11-29 19:38:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 587. [2020-11-29 19:38:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-11-29 19:38:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 717 transitions. [2020-11-29 19:38:05,910 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 717 transitions. Word has length 71 [2020-11-29 19:38:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:05,911 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 717 transitions. [2020-11-29 19:38:05,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:38:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 717 transitions. [2020-11-29 19:38:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-29 19:38:05,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:05,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:05,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-29 19:38:05,913 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash -62406471, now seen corresponding path program 1 times [2020-11-29 19:38:05,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:05,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542840326] [2020-11-29 19:38:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:06,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:06,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:06,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:06,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:06,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-29 19:38:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:06,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542840326] [2020-11-29 19:38:06,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:06,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:38:06,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081717857] [2020-11-29 19:38:06,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:38:06,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:06,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:38:06,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:38:06,295 INFO L87 Difference]: Start difference. First operand 587 states and 717 transitions. Second operand 14 states. [2020-11-29 19:38:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:08,261 INFO L93 Difference]: Finished difference Result 617 states and 753 transitions. [2020-11-29 19:38:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:38:08,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2020-11-29 19:38:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:08,263 INFO L225 Difference]: With dead ends: 617 [2020-11-29 19:38:08,263 INFO L226 Difference]: Without dead ends: 577 [2020-11-29 19:38:08,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:38:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-11-29 19:38:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 561. [2020-11-29 19:38:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-11-29 19:38:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 685 transitions. [2020-11-29 19:38:08,272 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 685 transitions. Word has length 69 [2020-11-29 19:38:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:08,272 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 685 transitions. [2020-11-29 19:38:08,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:38:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 685 transitions. [2020-11-29 19:38:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-29 19:38:08,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:08,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:08,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-29 19:38:08,275 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1044628259, now seen corresponding path program 1 times [2020-11-29 19:38:08,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:08,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357494137] [2020-11-29 19:38:08,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,492 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:08,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 19:38:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 19:38:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:08,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357494137] [2020-11-29 19:38:08,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:08,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 19:38:08,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468142435] [2020-11-29 19:38:08,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 19:38:08,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 19:38:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:38:08,758 INFO L87 Difference]: Start difference. First operand 561 states and 685 transitions. Second operand 15 states. [2020-11-29 19:38:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:11,084 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2020-11-29 19:38:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 19:38:11,087 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-11-29 19:38:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:11,089 INFO L225 Difference]: With dead ends: 587 [2020-11-29 19:38:11,089 INFO L226 Difference]: Without dead ends: 536 [2020-11-29 19:38:11,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:38:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-11-29 19:38:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 520. [2020-11-29 19:38:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2020-11-29 19:38:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 633 transitions. [2020-11-29 19:38:11,100 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 633 transitions. Word has length 72 [2020-11-29 19:38:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:11,100 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 633 transitions. [2020-11-29 19:38:11,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 19:38:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 633 transitions. [2020-11-29 19:38:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-29 19:38:11,102 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:11,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:11,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-29 19:38:11,102 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash -100030008, now seen corresponding path program 1 times [2020-11-29 19:38:11,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:11,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853232189] [2020-11-29 19:38:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,274 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:11,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-29 19:38:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 19:38:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:11,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853232189] [2020-11-29 19:38:11,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:11,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 19:38:11,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958720256] [2020-11-29 19:38:11,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 19:38:11,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:38:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:38:11,417 INFO L87 Difference]: Start difference. First operand 520 states and 633 transitions. Second operand 11 states. [2020-11-29 19:38:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:12,615 INFO L93 Difference]: Finished difference Result 525 states and 633 transitions. [2020-11-29 19:38:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:38:12,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-11-29 19:38:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:12,617 INFO L225 Difference]: With dead ends: 525 [2020-11-29 19:38:12,617 INFO L226 Difference]: Without dead ends: 525 [2020-11-29 19:38:12,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2020-11-29 19:38:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-11-29 19:38:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 502. [2020-11-29 19:38:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2020-11-29 19:38:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 603 transitions. [2020-11-29 19:38:12,626 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 603 transitions. Word has length 83 [2020-11-29 19:38:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:12,627 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 603 transitions. [2020-11-29 19:38:12,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 19:38:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 603 transitions. [2020-11-29 19:38:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-29 19:38:12,628 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:12,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:12,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-29 19:38:12,628 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1955222727, now seen corresponding path program 1 times [2020-11-29 19:38:12,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:12,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261224727] [2020-11-29 19:38:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:12,868 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:12,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:12,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:12,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:12,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 19:38:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:13,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:13,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:13,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:13,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-11-29 19:38:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:13,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:13,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261224727] [2020-11-29 19:38:13,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:13,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:38:13,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812801474] [2020-11-29 19:38:13,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:38:13,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:38:13,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:38:13,126 INFO L87 Difference]: Start difference. First operand 502 states and 603 transitions. Second operand 14 states. [2020-11-29 19:38:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:14,516 INFO L93 Difference]: Finished difference Result 586 states and 741 transitions. [2020-11-29 19:38:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 19:38:14,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 84 [2020-11-29 19:38:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:14,518 INFO L225 Difference]: With dead ends: 586 [2020-11-29 19:38:14,518 INFO L226 Difference]: Without dead ends: 586 [2020-11-29 19:38:14,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2020-11-29 19:38:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-11-29 19:38:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 466. [2020-11-29 19:38:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-11-29 19:38:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 557 transitions. [2020-11-29 19:38:14,527 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 557 transitions. Word has length 84 [2020-11-29 19:38:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:14,528 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 557 transitions. [2020-11-29 19:38:14,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:38:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 557 transitions. [2020-11-29 19:38:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-29 19:38:14,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:14,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:14,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-29 19:38:14,529 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash -371482752, now seen corresponding path program 1 times [2020-11-29 19:38:14,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:14,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961162927] [2020-11-29 19:38:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:14,722 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:14,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:14,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:14,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:14,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:14,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:14,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:14,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:15,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:15,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 19:38:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:15,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961162927] [2020-11-29 19:38:15,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:15,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-29 19:38:15,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899550979] [2020-11-29 19:38:15,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:38:15,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:38:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:38:15,029 INFO L87 Difference]: Start difference. First operand 466 states and 557 transitions. Second operand 16 states. [2020-11-29 19:38:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:16,703 INFO L93 Difference]: Finished difference Result 524 states and 627 transitions. [2020-11-29 19:38:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 19:38:16,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2020-11-29 19:38:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:16,705 INFO L225 Difference]: With dead ends: 524 [2020-11-29 19:38:16,705 INFO L226 Difference]: Without dead ends: 506 [2020-11-29 19:38:16,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2020-11-29 19:38:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-11-29 19:38:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 474. [2020-11-29 19:38:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-11-29 19:38:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 567 transitions. [2020-11-29 19:38:16,712 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 567 transitions. Word has length 89 [2020-11-29 19:38:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:16,712 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 567 transitions. [2020-11-29 19:38:16,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:38:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 567 transitions. [2020-11-29 19:38:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-29 19:38:16,714 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:16,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:16,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-29 19:38:16,714 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1480513325, now seen corresponding path program 1 times [2020-11-29 19:38:16,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:16,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69886395] [2020-11-29 19:38:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:16,912 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:16,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:16,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:16,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:17,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:17,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:17,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:17,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:17,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:17,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-29 19:38:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:17,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69886395] [2020-11-29 19:38:17,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:17,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-29 19:38:17,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854966096] [2020-11-29 19:38:17,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:38:17,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:17,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:38:17,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:38:17,224 INFO L87 Difference]: Start difference. First operand 474 states and 567 transitions. Second operand 16 states. [2020-11-29 19:38:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:18,463 INFO L93 Difference]: Finished difference Result 524 states and 626 transitions. [2020-11-29 19:38:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 19:38:18,463 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2020-11-29 19:38:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:18,464 INFO L225 Difference]: With dead ends: 524 [2020-11-29 19:38:18,464 INFO L226 Difference]: Without dead ends: 506 [2020-11-29 19:38:18,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-29 19:38:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-11-29 19:38:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 466. [2020-11-29 19:38:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-11-29 19:38:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 556 transitions. [2020-11-29 19:38:18,472 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 556 transitions. Word has length 90 [2020-11-29 19:38:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:18,472 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 556 transitions. [2020-11-29 19:38:18,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:38:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 556 transitions. [2020-11-29 19:38:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-29 19:38:18,474 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:18,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:18,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-11-29 19:38:18,474 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2076026327, now seen corresponding path program 1 times [2020-11-29 19:38:18,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:18,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988199023] [2020-11-29 19:38:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,633 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:18,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 19:38:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 19:38:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-29 19:38:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:18,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988199023] [2020-11-29 19:38:18,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:18,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 19:38:18,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850842798] [2020-11-29 19:38:18,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 19:38:18,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:18,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:38:18,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:38:18,890 INFO L87 Difference]: Start difference. First operand 466 states and 556 transitions. Second operand 13 states. [2020-11-29 19:38:19,084 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-29 19:38:19,384 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 19:38:19,778 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:38:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:22,738 INFO L93 Difference]: Finished difference Result 1328 states and 1543 transitions. [2020-11-29 19:38:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-29 19:38:22,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2020-11-29 19:38:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:22,741 INFO L225 Difference]: With dead ends: 1328 [2020-11-29 19:38:22,741 INFO L226 Difference]: Without dead ends: 1328 [2020-11-29 19:38:22,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2020-11-29 19:38:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2020-11-29 19:38:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1151. [2020-11-29 19:38:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2020-11-29 19:38:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1360 transitions. [2020-11-29 19:38:22,767 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1360 transitions. Word has length 93 [2020-11-29 19:38:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:22,767 INFO L481 AbstractCegarLoop]: Abstraction has 1151 states and 1360 transitions. [2020-11-29 19:38:22,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 19:38:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1360 transitions. [2020-11-29 19:38:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-29 19:38:22,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:22,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:22,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-29 19:38:22,770 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash 614453868, now seen corresponding path program 1 times [2020-11-29 19:38:22,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:22,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799610899] [2020-11-29 19:38:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:22,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:22,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:22,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:23,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:23,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 19:38:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:23,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:23,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 19:38:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:23,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 19:38:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:23,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799610899] [2020-11-29 19:38:23,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:23,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-29 19:38:23,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986725581] [2020-11-29 19:38:23,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:38:23,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:38:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:38:23,139 INFO L87 Difference]: Start difference. First operand 1151 states and 1360 transitions. Second operand 16 states. [2020-11-29 19:38:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:24,584 INFO L93 Difference]: Finished difference Result 1154 states and 1362 transitions. [2020-11-29 19:38:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:38:24,585 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2020-11-29 19:38:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:24,588 INFO L225 Difference]: With dead ends: 1154 [2020-11-29 19:38:24,588 INFO L226 Difference]: Without dead ends: 955 [2020-11-29 19:38:24,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-11-29 19:38:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2020-11-29 19:38:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 951. [2020-11-29 19:38:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2020-11-29 19:38:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1127 transitions. [2020-11-29 19:38:24,604 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1127 transitions. Word has length 94 [2020-11-29 19:38:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:24,604 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 1127 transitions. [2020-11-29 19:38:24,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:38:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1127 transitions. [2020-11-29 19:38:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-29 19:38:24,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:24,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:24,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-29 19:38:24,607 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash 894818333, now seen corresponding path program 1 times [2020-11-29 19:38:24,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:24,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310105197] [2020-11-29 19:38:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:24,793 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:24,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:24,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:24,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:24,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:24,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 19:38:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-11-29 19:38:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:25,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310105197] [2020-11-29 19:38:25,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:25,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:38:25,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640867612] [2020-11-29 19:38:25,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:38:25,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:38:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:38:25,127 INFO L87 Difference]: Start difference. First operand 951 states and 1127 transitions. Second operand 14 states. [2020-11-29 19:38:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:25,738 INFO L93 Difference]: Finished difference Result 947 states and 1117 transitions. [2020-11-29 19:38:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:38:25,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 100 [2020-11-29 19:38:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:25,741 INFO L225 Difference]: With dead ends: 947 [2020-11-29 19:38:25,741 INFO L226 Difference]: Without dead ends: 943 [2020-11-29 19:38:25,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:38:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2020-11-29 19:38:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2020-11-29 19:38:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2020-11-29 19:38:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 981 transitions. [2020-11-29 19:38:25,752 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 981 transitions. Word has length 100 [2020-11-29 19:38:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:25,753 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 981 transitions. [2020-11-29 19:38:25,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:38:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 981 transitions. [2020-11-29 19:38:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-29 19:38:25,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:25,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:25,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-29 19:38:25,755 INFO L429 AbstractCegarLoop]: === Iteration 54 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash 956195222, now seen corresponding path program 1 times [2020-11-29 19:38:25,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:25,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213341863] [2020-11-29 19:38:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:25,956 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:25,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 19:38:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-11-29 19:38:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:26,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213341863] [2020-11-29 19:38:26,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:26,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 19:38:26,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968767182] [2020-11-29 19:38:26,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 19:38:26,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 19:38:26,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:38:26,240 INFO L87 Difference]: Start difference. First operand 837 states and 981 transitions. Second operand 15 states. [2020-11-29 19:38:26,368 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 19:38:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:27,256 INFO L93 Difference]: Finished difference Result 863 states and 1007 transitions. [2020-11-29 19:38:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 19:38:27,257 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2020-11-29 19:38:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:27,258 INFO L225 Difference]: With dead ends: 863 [2020-11-29 19:38:27,258 INFO L226 Difference]: Without dead ends: 805 [2020-11-29 19:38:27,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2020-11-29 19:38:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-11-29 19:38:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2020-11-29 19:38:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-11-29 19:38:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 931 transitions. [2020-11-29 19:38:27,270 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 931 transitions. Word has length 100 [2020-11-29 19:38:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:27,271 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 931 transitions. [2020-11-29 19:38:27,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 19:38:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 931 transitions. [2020-11-29 19:38:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-29 19:38:27,273 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:27,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:27,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-29 19:38:27,273 INFO L429 AbstractCegarLoop]: === Iteration 55 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1545331794, now seen corresponding path program 1 times [2020-11-29 19:38:27,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:27,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905195736] [2020-11-29 19:38:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,458 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:27,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-29 19:38:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:27,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905195736] [2020-11-29 19:38:27,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:27,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-29 19:38:27,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063333263] [2020-11-29 19:38:27,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-29 19:38:27,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 19:38:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:38:27,902 INFO L87 Difference]: Start difference. First operand 797 states and 931 transitions. Second operand 19 states. [2020-11-29 19:38:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:28,738 INFO L93 Difference]: Finished difference Result 873 states and 1025 transitions. [2020-11-29 19:38:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 19:38:28,738 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2020-11-29 19:38:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:28,739 INFO L225 Difference]: With dead ends: 873 [2020-11-29 19:38:28,740 INFO L226 Difference]: Without dead ends: 835 [2020-11-29 19:38:28,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2020-11-29 19:38:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2020-11-29 19:38:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 815. [2020-11-29 19:38:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2020-11-29 19:38:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 943 transitions. [2020-11-29 19:38:28,748 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 943 transitions. Word has length 105 [2020-11-29 19:38:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:28,748 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 943 transitions. [2020-11-29 19:38:28,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-29 19:38:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 943 transitions. [2020-11-29 19:38:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-29 19:38:28,750 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:28,750 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:28,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-29 19:38:28,751 INFO L429 AbstractCegarLoop]: === Iteration 56 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1819473127, now seen corresponding path program 1 times [2020-11-29 19:38:28,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:28,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923152391] [2020-11-29 19:38:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:28,951 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:28,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:28,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 19:38:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-29 19:38:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 19:38:29,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923152391] [2020-11-29 19:38:29,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:29,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 19:38:29,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285770886] [2020-11-29 19:38:29,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:38:29,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:38:29,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:38:29,192 INFO L87 Difference]: Start difference. First operand 815 states and 943 transitions. Second operand 14 states. [2020-11-29 19:38:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:29,749 INFO L93 Difference]: Finished difference Result 718 states and 810 transitions. [2020-11-29 19:38:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:38:29,750 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 114 [2020-11-29 19:38:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:29,751 INFO L225 Difference]: With dead ends: 718 [2020-11-29 19:38:29,751 INFO L226 Difference]: Without dead ends: 718 [2020-11-29 19:38:29,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2020-11-29 19:38:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-11-29 19:38:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 450. [2020-11-29 19:38:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-29 19:38:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 500 transitions. [2020-11-29 19:38:29,759 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 500 transitions. Word has length 114 [2020-11-29 19:38:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:29,759 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 500 transitions. [2020-11-29 19:38:29,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:38:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 500 transitions. [2020-11-29 19:38:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-29 19:38:29,761 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:29,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:29,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-11-29 19:38:29,761 INFO L429 AbstractCegarLoop]: === Iteration 57 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2046815219, now seen corresponding path program 1 times [2020-11-29 19:38:29,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:29,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116168322] [2020-11-29 19:38:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,929 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:29,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:29,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-29 19:38:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 19:38:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:30,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116168322] [2020-11-29 19:38:30,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:30,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 19:38:30,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383305621] [2020-11-29 19:38:30,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 19:38:30,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 19:38:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:38:30,257 INFO L87 Difference]: Start difference. First operand 450 states and 500 transitions. Second operand 15 states. [2020-11-29 19:38:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:31,052 INFO L93 Difference]: Finished difference Result 478 states and 532 transitions. [2020-11-29 19:38:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:38:31,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 121 [2020-11-29 19:38:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:31,053 INFO L225 Difference]: With dead ends: 478 [2020-11-29 19:38:31,053 INFO L226 Difference]: Without dead ends: 478 [2020-11-29 19:38:31,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:38:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-11-29 19:38:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 458. [2020-11-29 19:38:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-29 19:38:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 508 transitions. [2020-11-29 19:38:31,058 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 508 transitions. Word has length 121 [2020-11-29 19:38:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:31,058 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 508 transitions. [2020-11-29 19:38:31,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 19:38:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 508 transitions. [2020-11-29 19:38:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-29 19:38:31,059 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:31,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:31,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-11-29 19:38:31,059 INFO L429 AbstractCegarLoop]: === Iteration 58 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash -917037966, now seen corresponding path program 1 times [2020-11-29 19:38:31,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:31,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517523822] [2020-11-29 19:38:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,235 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:31,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-29 19:38:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 19:38:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:38:31,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517523822] [2020-11-29 19:38:31,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:31,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 19:38:31,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246989420] [2020-11-29 19:38:31,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 19:38:31,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:31,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 19:38:31,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:38:31,513 INFO L87 Difference]: Start difference. First operand 458 states and 508 transitions. Second operand 15 states. [2020-11-29 19:38:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:32,253 INFO L93 Difference]: Finished difference Result 478 states and 528 transitions. [2020-11-29 19:38:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:38:32,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 121 [2020-11-29 19:38:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:32,255 INFO L225 Difference]: With dead ends: 478 [2020-11-29 19:38:32,255 INFO L226 Difference]: Without dead ends: 470 [2020-11-29 19:38:32,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:38:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-11-29 19:38:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2020-11-29 19:38:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-29 19:38:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 506 transitions. [2020-11-29 19:38:32,260 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 506 transitions. Word has length 121 [2020-11-29 19:38:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:32,260 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 506 transitions. [2020-11-29 19:38:32,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 19:38:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 506 transitions. [2020-11-29 19:38:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-29 19:38:32,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:32,262 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:32,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-11-29 19:38:32,262 INFO L429 AbstractCegarLoop]: === Iteration 59 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash -39353306, now seen corresponding path program 1 times [2020-11-29 19:38:32,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:32,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425664641] [2020-11-29 19:38:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-29 19:38:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:32,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-29 19:38:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 19:38:33,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425664641] [2020-11-29 19:38:33,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:33,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 19:38:33,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465783148] [2020-11-29 19:38:33,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 19:38:33,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 19:38:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2020-11-29 19:38:33,007 INFO L87 Difference]: Start difference. First operand 458 states and 506 transitions. Second operand 25 states. [2020-11-29 19:38:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:34,195 INFO L93 Difference]: Finished difference Result 582 states and 662 transitions. [2020-11-29 19:38:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-29 19:38:34,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 151 [2020-11-29 19:38:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:34,196 INFO L225 Difference]: With dead ends: 582 [2020-11-29 19:38:34,196 INFO L226 Difference]: Without dead ends: 532 [2020-11-29 19:38:34,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 19:38:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-11-29 19:38:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 492. [2020-11-29 19:38:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2020-11-29 19:38:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 548 transitions. [2020-11-29 19:38:34,202 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 548 transitions. Word has length 151 [2020-11-29 19:38:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:34,202 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 548 transitions. [2020-11-29 19:38:34,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 19:38:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 548 transitions. [2020-11-29 19:38:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-11-29 19:38:34,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:34,203 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:34,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-29 19:38:34,203 INFO L429 AbstractCegarLoop]: === Iteration 60 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:34,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1122063607, now seen corresponding path program 1 times [2020-11-29 19:38:34,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:34,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198266401] [2020-11-29 19:38:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,452 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:34,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-29 19:38:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-29 19:38:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 19:38:34,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198266401] [2020-11-29 19:38:34,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:34,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-29 19:38:34,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834752664] [2020-11-29 19:38:34,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-29 19:38:34,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 19:38:34,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:38:34,895 INFO L87 Difference]: Start difference. First operand 492 states and 548 transitions. Second operand 19 states. [2020-11-29 19:38:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:35,719 INFO L93 Difference]: Finished difference Result 530 states and 590 transitions. [2020-11-29 19:38:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 19:38:35,719 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 152 [2020-11-29 19:38:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:35,721 INFO L225 Difference]: With dead ends: 530 [2020-11-29 19:38:35,721 INFO L226 Difference]: Without dead ends: 520 [2020-11-29 19:38:35,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2020-11-29 19:38:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-11-29 19:38:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 492. [2020-11-29 19:38:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2020-11-29 19:38:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 546 transitions. [2020-11-29 19:38:35,730 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 546 transitions. Word has length 152 [2020-11-29 19:38:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:35,731 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 546 transitions. [2020-11-29 19:38:35,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-29 19:38:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 546 transitions. [2020-11-29 19:38:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-11-29 19:38:35,733 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:35,733 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:35,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-11-29 19:38:35,733 INFO L429 AbstractCegarLoop]: === Iteration 61 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash -689937177, now seen corresponding path program 1 times [2020-11-29 19:38:35,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:35,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401986893] [2020-11-29 19:38:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:35,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:35,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-29 19:38:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-29 19:38:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-29 19:38:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 19:38:36,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401986893] [2020-11-29 19:38:36,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:36,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-29 19:38:36,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518653028] [2020-11-29 19:38:36,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-29 19:38:36,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:36,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 19:38:36,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:38:36,378 INFO L87 Difference]: Start difference. First operand 492 states and 546 transitions. Second operand 21 states. [2020-11-29 19:38:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:37,650 INFO L93 Difference]: Finished difference Result 554 states and 622 transitions. [2020-11-29 19:38:37,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 19:38:37,651 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2020-11-29 19:38:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:37,652 INFO L225 Difference]: With dead ends: 554 [2020-11-29 19:38:37,652 INFO L226 Difference]: Without dead ends: 492 [2020-11-29 19:38:37,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2020-11-29 19:38:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-11-29 19:38:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 480. [2020-11-29 19:38:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-11-29 19:38:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 528 transitions. [2020-11-29 19:38:37,657 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 528 transitions. Word has length 154 [2020-11-29 19:38:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:37,657 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 528 transitions. [2020-11-29 19:38:37,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-29 19:38:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 528 transitions. [2020-11-29 19:38:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-29 19:38:37,658 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:37,658 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:37,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-11-29 19:38:37,659 INFO L429 AbstractCegarLoop]: === Iteration 62 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash 913401798, now seen corresponding path program 1 times [2020-11-29 19:38:37,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:37,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594358134] [2020-11-29 19:38:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:37,854 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:37,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:37,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:37,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:37,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:37,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-29 19:38:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-29 19:38:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-11-29 19:38:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 19:38:38,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594358134] [2020-11-29 19:38:38,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:38,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 19:38:38,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052999249] [2020-11-29 19:38:38,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 19:38:38,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 19:38:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:38:38,171 INFO L87 Difference]: Start difference. First operand 480 states and 528 transitions. Second operand 15 states. [2020-11-29 19:38:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:38,845 INFO L93 Difference]: Finished difference Result 474 states and 516 transitions. [2020-11-29 19:38:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:38:38,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 159 [2020-11-29 19:38:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:38,847 INFO L225 Difference]: With dead ends: 474 [2020-11-29 19:38:38,847 INFO L226 Difference]: Without dead ends: 452 [2020-11-29 19:38:38,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2020-11-29 19:38:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-29 19:38:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 424. [2020-11-29 19:38:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-29 19:38:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 460 transitions. [2020-11-29 19:38:38,852 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 460 transitions. Word has length 159 [2020-11-29 19:38:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:38,852 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 460 transitions. [2020-11-29 19:38:38,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 19:38:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 460 transitions. [2020-11-29 19:38:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-29 19:38:38,854 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:38,854 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:38,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-11-29 19:38:38,854 INFO L429 AbstractCegarLoop]: === Iteration 63 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2068596931, now seen corresponding path program 1 times [2020-11-29 19:38:38,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:38,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973707376] [2020-11-29 19:38:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:38,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-29 19:38:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-29 19:38:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-29 19:38:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 19:38:39,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973707376] [2020-11-29 19:38:39,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:39,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-29 19:38:39,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662652403] [2020-11-29 19:38:39,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-29 19:38:39,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:39,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 19:38:39,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2020-11-29 19:38:39,364 INFO L87 Difference]: Start difference. First operand 424 states and 460 transitions. Second operand 17 states. [2020-11-29 19:38:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:39,898 INFO L93 Difference]: Finished difference Result 402 states and 432 transitions. [2020-11-29 19:38:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:38:39,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 161 [2020-11-29 19:38:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:39,899 INFO L225 Difference]: With dead ends: 402 [2020-11-29 19:38:39,899 INFO L226 Difference]: Without dead ends: 382 [2020-11-29 19:38:39,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2020-11-29 19:38:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-11-29 19:38:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2020-11-29 19:38:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-11-29 19:38:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 410 transitions. [2020-11-29 19:38:39,903 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 410 transitions. Word has length 161 [2020-11-29 19:38:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:39,903 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 410 transitions. [2020-11-29 19:38:39,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-29 19:38:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 410 transitions. [2020-11-29 19:38:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-11-29 19:38:39,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:39,905 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:39,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-11-29 19:38:39,906 INFO L429 AbstractCegarLoop]: === Iteration 64 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1371420135, now seen corresponding path program 1 times [2020-11-29 19:38:39,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:39,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324918181] [2020-11-29 19:38:39,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,146 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 19:38:40,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-29 19:38:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-29 19:38:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-29 19:38:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:38:40,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324918181] [2020-11-29 19:38:40,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:40,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-29 19:38:40,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155352204] [2020-11-29 19:38:40,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-29 19:38:40,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-29 19:38:40,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:38:40,545 INFO L87 Difference]: Start difference. First operand 382 states and 410 transitions. Second operand 20 states. [2020-11-29 19:38:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:42,071 INFO L93 Difference]: Finished difference Result 662 states and 707 transitions. [2020-11-29 19:38:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-29 19:38:42,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 162 [2020-11-29 19:38:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:42,072 INFO L225 Difference]: With dead ends: 662 [2020-11-29 19:38:42,073 INFO L226 Difference]: Without dead ends: 388 [2020-11-29 19:38:42,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2020-11-29 19:38:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-11-29 19:38:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 382. [2020-11-29 19:38:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-11-29 19:38:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 409 transitions. [2020-11-29 19:38:42,077 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 409 transitions. Word has length 162 [2020-11-29 19:38:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:42,078 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 409 transitions. [2020-11-29 19:38:42,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-29 19:38:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 409 transitions. [2020-11-29 19:38:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-11-29 19:38:42,079 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:38:42,079 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:38:42,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-11-29 19:38:42,079 INFO L429 AbstractCegarLoop]: === Iteration 65 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 19:38:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:38:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1476966295, now seen corresponding path program 1 times [2020-11-29 19:38:42,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:38:42,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159504234] [2020-11-29 19:38:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:38:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 19:38:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 19:38:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 19:38:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 19:38:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 19:38:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 19:38:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 19:38:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 19:38:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 19:38:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 19:38:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 19:38:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-29 19:38:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-29 19:38:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-29 19:38:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:38:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:38:42,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159504234] [2020-11-29 19:38:42,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:38:42,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 19:38:42,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732483244] [2020-11-29 19:38:42,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 19:38:42,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:38:42,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 19:38:42,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2020-11-29 19:38:42,716 INFO L87 Difference]: Start difference. First operand 382 states and 409 transitions. Second operand 25 states. [2020-11-29 19:38:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:38:44,290 INFO L93 Difference]: Finished difference Result 384 states and 413 transitions. [2020-11-29 19:38:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-29 19:38:44,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 162 [2020-11-29 19:38:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:38:44,291 INFO L225 Difference]: With dead ends: 384 [2020-11-29 19:38:44,291 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 19:38:44,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2020-11-29 19:38:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 19:38:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 19:38:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 19:38:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 19:38:44,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2020-11-29 19:38:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:38:44,292 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:38:44,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 19:38:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 19:38:44,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 19:38:44,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-11-29 19:38:44,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:38:44 BoogieIcfgContainer [2020-11-29 19:38:44,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:38:44,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:38:44,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:38:44,299 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:38:44,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:36:16" (3/4) ... [2020-11-29 19:38:44,302 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 19:38:44,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-11-29 19:38:44,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2020-11-29 19:38:44,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2020-11-29 19:38:44,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2020-11-29 19:38:44,311 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2020-11-29 19:38:44,311 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2020-11-29 19:38:44,311 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2020-11-29 19:38:44,312 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2020-11-29 19:38:44,313 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-11-29 19:38:44,314 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2020-11-29 19:38:44,314 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2020-11-29 19:38:44,314 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2020-11-29 19:38:44,314 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2020-11-29 19:38:44,314 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2020-11-29 19:38:44,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2020-11-29 19:38:44,352 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 87 nodes and edges [2020-11-29 19:38:44,355 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2020-11-29 19:38:44,358 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-29 19:38:44,361 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-11-29 19:38:44,571 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5b247135-a3bb-4081-9b12-822d9386d505/bin/uautomizer/witness.graphml [2020-11-29 19:38:44,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:38:44,573 INFO L168 Benchmark]: Toolchain (without parser) took 150679.53 ms. Allocated memory was 92.3 MB in the beginning and 597.7 MB in the end (delta: 505.4 MB). Free memory was 60.8 MB in the beginning and 548.2 MB in the end (delta: -487.4 MB). Peak memory consumption was 355.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:38:44,573 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 92.3 MB. Free memory was 49.5 MB in the beginning and 49.4 MB in the end (delta: 78.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:38:44,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.20 ms. Allocated memory is still 92.3 MB. Free memory was 60.5 MB in the beginning and 55.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:38:44,574 INFO L168 Benchmark]: Boogie Preprocessor took 106.32 ms. Allocated memory is still 92.3 MB. Free memory was 55.1 MB in the beginning and 50.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:38:44,575 INFO L168 Benchmark]: RCFGBuilder took 2002.22 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 50.6 MB in the beginning and 36.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. [2020-11-29 19:38:44,575 INFO L168 Benchmark]: TraceAbstraction took 147509.75 ms. Allocated memory was 111.1 MB in the beginning and 597.7 MB in the end (delta: 486.5 MB). Free memory was 36.1 MB in the beginning and 224.1 MB in the end (delta: -188.0 MB). Peak memory consumption was 299.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:38:44,576 INFO L168 Benchmark]: Witness Printer took 273.20 ms. Allocated memory is still 597.7 MB. Free memory was 224.1 MB in the beginning and 548.2 MB in the end (delta: -324.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:38:44,578 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 92.3 MB. Free memory was 49.5 MB in the beginning and 49.4 MB in the end (delta: 78.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 782.20 ms. Allocated memory is still 92.3 MB. Free memory was 60.5 MB in the beginning and 55.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 106.32 ms. Allocated memory is still 92.3 MB. Free memory was 55.1 MB in the beginning and 50.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2002.22 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 50.6 MB in the beginning and 36.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 147509.75 ms. Allocated memory was 111.1 MB in the beginning and 597.7 MB in the end (delta: 486.5 MB). Free memory was 36.1 MB in the beginning and 224.1 MB in the end (delta: -188.0 MB). Peak memory consumption was 299.1 MB. Max. memory is 16.1 GB. * Witness Printer took 273.20 ms. Allocated memory is still 597.7 MB. Free memory was 224.1 MB in the beginning and 548.2 MB in the end (delta: -324.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 397 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 147.4s, OverallIterations: 65, TraceHistogramMax: 2, AutomataDifference: 117.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24388 SDtfs, 29338 SDslu, 49958 SDs, 0 SdLazy, 94537 SolverSat, 9147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1823 GetRequests, 807 SyntacticMatches, 10 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3253 ImplicationChecksByTransitivity, 36.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1151occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 65 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 4683 NumberOfCodeBlocks, 4683 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 4618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1678920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 204/204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...