./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version b2eff8ba
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD --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 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-b2eff8b
[2021-10-28 23:15:25,389 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-28 23:15:25,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-28 23:15:25,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-28 23:15:25,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-28 23:15:25,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-28 23:15:25,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-28 23:15:25,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-28 23:15:25,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-28 23:15:25,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-28 23:15:25,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-28 23:15:25,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-28 23:15:25,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-28 23:15:25,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-28 23:15:25,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-28 23:15:25,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-28 23:15:25,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-28 23:15:25,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-28 23:15:25,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-28 23:15:25,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-28 23:15:25,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-28 23:15:25,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-28 23:15:25,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-28 23:15:25,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-28 23:15:25,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-28 23:15:25,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-28 23:15:25,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-28 23:15:25,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-28 23:15:25,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-28 23:15:25,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-28 23:15:25,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-28 23:15:25,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-28 23:15:25,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-28 23:15:25,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-28 23:15:25,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-28 23:15:25,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-28 23:15:25,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-28 23:15:25,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-28 23:15:25,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-28 23:15:25,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-28 23:15:25,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-28 23:15:25,519 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2021-10-28 23:15:25,555 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-28 23:15:25,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-28 23:15:25,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-28 23:15:25,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-28 23:15:25,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-28 23:15:25,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-28 23:15:25,558 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-28 23:15:25,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-28 23:15:25,558 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-28 23:15:25,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2021-10-28 23:15:25,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-28 23:15:25,559 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-28 23:15:25,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-28 23:15:25,559 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2021-10-28 23:15:25,560 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2021-10-28 23:15:25,560 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2021-10-28 23:15:25,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-28 23:15:25,560 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2021-10-28 23:15:25,561 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-28 23:15:25,561 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-28 23:15:25,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-28 23:15:25,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-28 23:15:25,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-28 23:15:25,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-28 23:15:25,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-28 23:15:25,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-28 23:15:25,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-28 23:15:25,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-28 23:15:25,563 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-28 23:15:25,563 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_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/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_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD
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 -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa
[2021-10-28 23:15:25,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-28 23:15:25,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-28 23:15:25,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-28 23:15:25,882 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-28 23:15:25,884 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-28 23:15:25,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c
[2021-10-28 23:15:25,962 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/data/75c91c7c1/80bc9a5c6c194853bd2058d8d15f4b5d/FLAG78274a4ed
[2021-10-28 23:15:26,474 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-28 23:15:26,475 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c
[2021-10-28 23:15:26,496 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/data/75c91c7c1/80bc9a5c6c194853bd2058d8d15f4b5d/FLAG78274a4ed
[2021-10-28 23:15:26,781 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/data/75c91c7c1/80bc9a5c6c194853bd2058d8d15f4b5d
[2021-10-28 23:15:26,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-28 23:15:26,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-10-28 23:15:26,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-28 23:15:26,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-28 23:15:26,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-28 23:15:26,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:15:26" (1/1) ...
[2021-10-28 23:15:26,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4450ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:26, skipping insertion in model container
[2021-10-28 23:15:26,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:15:26" (1/1) ...
[2021-10-28 23:15:26,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-28 23:15:26,890 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-28 23:15:27,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726]
[2021-10-28 23:15:27,333 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:15:27,347 INFO L203 MainTranslator]: Completed pre-run
[2021-10-28 23:15:27,387 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726]
[2021-10-28 23:15:27,468 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:15:27,489 INFO L208 MainTranslator]: Completed translation
[2021-10-28 23:15:27,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27 WrapperNode
[2021-10-28 23:15:27,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-28 23:15:27,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-28 23:15:27,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-28 23:15:27,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-28 23:15:27,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-28 23:15:27,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-28 23:15:27,597 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-28 23:15:27,597 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-28 23:15:27,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (1/1) ...
[2021-10-28 23:15:27,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-28 23:15:27,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:15:27,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-10-28 23:15:27,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-10-28 23:15:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2021-10-28 23:15:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-28 23:15:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2021-10-28 23:15:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn
[2021-10-28 23:15:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init
[2021-10-28 23:15:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy
[2021-10-28 23:15:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread
[2021-10-28 23:15:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp
[2021-10-28 23:15:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice
[2021-10-28 23:15:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete
[2021-10-28 23:15:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo
[2021-10-28 23:15:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests
[2021-10-28 23:15:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init
[2021-10-28 23:15:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2021-10-28 23:15:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest
[2021-10-28 23:15:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink
[2021-10-28 23:15:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription
[2021-10-28 23:15:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface
[2021-10-28 23:15:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState
[2021-10-28 23:15:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired
[2021-10-28 23:15:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver
[2021-10-28 23:15:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest
[2021-10-28 23:15:27,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent
[2021-10-28 23:15:27,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject
[2021-10-28 23:15:27,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle
[2021-10-28 23:15:27,698 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread
[2021-10-28 23:15:27,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose
[2021-10-28 23:15:27,699 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose
[2021-10-28 23:15:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2021-10-28 23:15:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2021-10-28 23:15:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2021-10-28 23:15:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-28 23:15:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2021-10-28 23:15:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2021-10-28 23:15:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long
[2021-10-28 23:15:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy
[2021-10-28 23:15:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread
[2021-10-28 23:15:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp
[2021-10-28 23:15:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice
[2021-10-28 23:15:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete
[2021-10-28 23:15:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo
[2021-10-28 23:15:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest
[2021-10-28 23:15:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink
[2021-10-28 23:15:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription
[2021-10-28 23:15:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface
[2021-10-28 23:15:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState
[2021-10-28 23:15:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver
[2021-10-28 23:15:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent
[2021-10-28 23:15:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject
[2021-10-28 23:15:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle
[2021-10-28 23:15:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread
[2021-10-28 23:15:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose
[2021-10-28 23:15:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest
[2021-10-28 23:15:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn
[2021-10-28 23:15:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init
[2021-10-28 23:15:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests
[2021-10-28 23:15:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init
[2021-10-28 23:15:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2021-10-28 23:15:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired
[2021-10-28 23:15:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose
[2021-10-28 23:15:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2021-10-28 23:15:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-28 23:15:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-28 23:15:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-28 23:15:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2021-10-28 23:15:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-28 23:15:27,967 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,014 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,014 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,025 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,037 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,037 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,044 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false;
[2021-10-28 23:15:28,288 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false;
[2021-10-28 23:15:28,291 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,381 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false;
[2021-10-28 23:15:28,381 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false;
[2021-10-28 23:15:28,393 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,409 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false;
[2021-10-28 23:15:28,410 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false;
[2021-10-28 23:15:28,479 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,494 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,494 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,495 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,502 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,502 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,502 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,511 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,511 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,548 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,605 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false;
[2021-10-28 23:15:28,606 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false;
[2021-10-28 23:15:28,652 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,674 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,674 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,675 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,686 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,686 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,687 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:15:28,697 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false;
[2021-10-28 23:15:28,698 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false;
[2021-10-28 23:15:28,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-28 23:15:28,723 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2021-10-28 23:15:28,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:15:28 BoogieIcfgContainer
[2021-10-28 23:15:28,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-28 23:15:28,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-28 23:15:28,729 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-28 23:15:28,733 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-28 23:15:28,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:15:26" (1/3) ...
[2021-10-28 23:15:28,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae1ae86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:15:28, skipping insertion in model container
[2021-10-28 23:15:28,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:27" (2/3) ...
[2021-10-28 23:15:28,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae1ae86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:15:28, skipping insertion in model container
[2021-10-28 23:15:28,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:15:28" (3/3) ...
[2021-10-28 23:15:28,736 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c
[2021-10-28 23:15:28,742 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-28 23:15:28,743 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-10-28 23:15:28,794 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-10-28 23:15:28,801 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2021-10-28 23:15:28,801 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2021-10-28 23:15:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 244 states have internal predecessors, (315), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56)
[2021-10-28 23:15:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-28 23:15:28,836 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:28,837 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:15:28,838 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2120787036, now seen corresponding path program 1 times
[2021-10-28 23:15:28,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:28,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223556910]
[2021-10-28 23:15:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:28,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:29,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:29,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:29,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223556910]
[2021-10-28 23:15:29,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223556910] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:29,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:29,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:15:29,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620790920]
[2021-10-28 23:15:29,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-10-28 23:15:29,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:29,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-28 23:15:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-28 23:15:29,376 INFO L87 Difference]: Start difference. First operand has 305 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 244 states have internal predecessors, (315), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2021-10-28 23:15:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:30,317 INFO L93 Difference]: Finished difference Result 329 states and 449 transitions.
[2021-10-28 23:15:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-28 23:15:30,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15
[2021-10-28 23:15:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:30,342 INFO L225 Difference]: With dead ends: 329
[2021-10-28 23:15:30,343 INFO L226 Difference]: Without dead ends: 322
[2021-10-28 23:15:30,344 INFO L786 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
[2021-10-28 23:15:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states.
[2021-10-28 23:15:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292.
[2021-10-28 23:15:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.375586854460094) internal successors, (293), 233 states have internal predecessors, (293), 56 states have call successors, (56), 24 states have call predecessors, (56), 22 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37)
[2021-10-28 23:15:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 386 transitions.
[2021-10-28 23:15:30,438 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 386 transitions. Word has length 15
[2021-10-28 23:15:30,439 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:30,439 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 386 transitions.
[2021-10-28 23:15:30,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2021-10-28 23:15:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 386 transitions.
[2021-10-28 23:15:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-28 23:15:30,441 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:30,441 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:15:30,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-28 23:15:30,441 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1263023814, now seen corresponding path program 1 times
[2021-10-28 23:15:30,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:30,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957029771]
[2021-10-28 23:15:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:30,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:30,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:30,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957029771]
[2021-10-28 23:15:30,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957029771] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:30,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:30,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-28 23:15:30,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136482492]
[2021-10-28 23:15:30,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2021-10-28 23:15:30,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-28 23:15:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-28 23:15:30,723 INFO L87 Difference]: Start difference. First operand 292 states and 386 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-10-28 23:15:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:31,789 INFO L93 Difference]: Finished difference Result 322 states and 432 transitions.
[2021-10-28 23:15:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-28 23:15:31,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2021-10-28 23:15:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:31,793 INFO L225 Difference]: With dead ends: 322
[2021-10-28 23:15:31,793 INFO L226 Difference]: Without dead ends: 322
[2021-10-28 23:15:31,794 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-28 23:15:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states.
[2021-10-28 23:15:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292.
[2021-10-28 23:15:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.3708920187793427) internal successors, (292), 233 states have internal predecessors, (292), 56 states have call successors, (56), 24 states have call predecessors, (56), 22 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37)
[2021-10-28 23:15:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions.
[2021-10-28 23:15:31,814 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20
[2021-10-28 23:15:31,815 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:31,815 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions.
[2021-10-28 23:15:31,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-10-28 23:15:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions.
[2021-10-28 23:15:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2021-10-28 23:15:31,816 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:31,816 INFO L513 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]
[2021-10-28 23:15:31,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-28 23:15:31,817 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:31,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1377431699, now seen corresponding path program 1 times
[2021-10-28 23:15:31,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:31,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653860850]
[2021-10-28 23:15:31,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:31,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:32,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:32,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653860850]
[2021-10-28 23:15:32,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653860850] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:32,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:32,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:15:32,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265940547]
[2021-10-28 23:15:32,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:15:32,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:15:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:15:32,079 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:34,187 INFO L93 Difference]: Finished difference Result 477 states and 636 transitions.
[2021-10-28 23:15:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:15:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28
[2021-10-28 23:15:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:34,193 INFO L225 Difference]: With dead ends: 477
[2021-10-28 23:15:34,194 INFO L226 Difference]: Without dead ends: 476
[2021-10-28 23:15:34,194 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:15:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states.
[2021-10-28 23:15:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 429.
[2021-10-28 23:15:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 328 states have (on average 1.3140243902439024) internal successors, (431), 334 states have internal predecessors, (431), 65 states have call successors, (65), 37 states have call predecessors, (65), 35 states have return successors, (74), 59 states have call predecessors, (74), 54 states have call successors, (74)
[2021-10-28 23:15:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 570 transitions.
[2021-10-28 23:15:34,224 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 570 transitions. Word has length 28
[2021-10-28 23:15:34,224 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:34,224 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 570 transitions.
[2021-10-28 23:15:34,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 570 transitions.
[2021-10-28 23:15:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2021-10-28 23:15:34,226 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:34,226 INFO L513 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]
[2021-10-28 23:15:34,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-28 23:15:34,227 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1586729981, now seen corresponding path program 1 times
[2021-10-28 23:15:34,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:34,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718917672]
[2021-10-28 23:15:34,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:34,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:34,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:34,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718917672]
[2021-10-28 23:15:34,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718917672] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:34,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:34,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:15:34,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975572824]
[2021-10-28 23:15:34,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:15:34,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:34,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:15:34,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:15:34,457 INFO L87 Difference]: Start difference. First operand 429 states and 570 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:35,467 INFO L93 Difference]: Finished difference Result 675 states and 900 transitions.
[2021-10-28 23:15:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:15:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30
[2021-10-28 23:15:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:35,483 INFO L225 Difference]: With dead ends: 675
[2021-10-28 23:15:35,483 INFO L226 Difference]: Without dead ends: 675
[2021-10-28 23:15:35,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:15:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states.
[2021-10-28 23:15:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 632.
[2021-10-28 23:15:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 493 states have (on average 1.3144016227180528) internal successors, (648), 497 states have internal predecessors, (648), 85 states have call successors, (85), 55 states have call predecessors, (85), 53 states have return successors, (112), 81 states have call predecessors, (112), 76 states have call successors, (112)
[2021-10-28 23:15:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 845 transitions.
[2021-10-28 23:15:35,557 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 845 transitions. Word has length 30
[2021-10-28 23:15:35,558 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:35,558 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 845 transitions.
[2021-10-28 23:15:35,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 845 transitions.
[2021-10-28 23:15:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2021-10-28 23:15:35,562 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:35,563 INFO L513 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]
[2021-10-28 23:15:35,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-28 23:15:35,563 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:35,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash -962074547, now seen corresponding path program 1 times
[2021-10-28 23:15:35,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:35,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852113167]
[2021-10-28 23:15:35,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:35,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:35,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:35,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852113167]
[2021-10-28 23:15:35,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852113167] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:35,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:35,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:15:35,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609837159]
[2021-10-28 23:15:35,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:15:35,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:15:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:15:35,856 INFO L87 Difference]: Start difference. First operand 632 states and 845 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:36,949 INFO L93 Difference]: Finished difference Result 721 states and 953 transitions.
[2021-10-28 23:15:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:15:36,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34
[2021-10-28 23:15:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:36,957 INFO L225 Difference]: With dead ends: 721
[2021-10-28 23:15:36,957 INFO L226 Difference]: Without dead ends: 721
[2021-10-28 23:15:36,958 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:15:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states.
[2021-10-28 23:15:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 670.
[2021-10-28 23:15:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 525 states have (on average 1.3161904761904761) internal successors, (691), 535 states have internal predecessors, (691), 86 states have call successors, (86), 57 states have call predecessors, (86), 58 states have return successors, (117), 80 states have call predecessors, (117), 78 states have call successors, (117)
[2021-10-28 23:15:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 894 transitions.
[2021-10-28 23:15:37,003 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 894 transitions. Word has length 34
[2021-10-28 23:15:37,003 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:37,003 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 894 transitions.
[2021-10-28 23:15:37,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 894 transitions.
[2021-10-28 23:15:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2021-10-28 23:15:37,012 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:37,012 INFO L513 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]
[2021-10-28 23:15:37,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-28 23:15:37,013 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash 82742685, now seen corresponding path program 1 times
[2021-10-28 23:15:37,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:37,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088564862]
[2021-10-28 23:15:37,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:37,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:37,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:37,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2021-10-28 23:15:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:37,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:37,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088564862]
[2021-10-28 23:15:37,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088564862] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:37,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:37,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-10-28 23:15:37,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841272776]
[2021-10-28 23:15:37,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-10-28 23:15:37,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:37,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-10-28 23:15:37,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:15:37,277 INFO L87 Difference]: Start difference. First operand 670 states and 894 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:15:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:38,743 INFO L93 Difference]: Finished difference Result 696 states and 924 transitions.
[2021-10-28 23:15:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:15:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41
[2021-10-28 23:15:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:38,750 INFO L225 Difference]: With dead ends: 696
[2021-10-28 23:15:38,750 INFO L226 Difference]: Without dead ends: 696
[2021-10-28 23:15:38,750 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:15:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states.
[2021-10-28 23:15:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 674.
[2021-10-28 23:15:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 528 states have (on average 1.3143939393939394) internal successors, (694), 538 states have internal predecessors, (694), 86 states have call successors, (86), 57 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118)
[2021-10-28 23:15:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 898 transitions.
[2021-10-28 23:15:38,812 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 898 transitions. Word has length 41
[2021-10-28 23:15:38,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:38,814 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 898 transitions.
[2021-10-28 23:15:38,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:15:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 898 transitions.
[2021-10-28 23:15:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2021-10-28 23:15:38,817 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:38,817 INFO L513 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]
[2021-10-28 23:15:38,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-28 23:15:38,818 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash -127535261, now seen corresponding path program 1 times
[2021-10-28 23:15:38,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:38,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818224091]
[2021-10-28 23:15:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:38,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:39,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:39,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818224091]
[2021-10-28 23:15:39,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818224091] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:39,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:39,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-28 23:15:39,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921194846]
[2021-10-28 23:15:39,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-28 23:15:39,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:15:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:15:39,084 INFO L87 Difference]: Start difference. First operand 674 states and 898 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:39,997 INFO L93 Difference]: Finished difference Result 698 states and 928 transitions.
[2021-10-28 23:15:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:15:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40
[2021-10-28 23:15:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:40,004 INFO L225 Difference]: With dead ends: 698
[2021-10-28 23:15:40,004 INFO L226 Difference]: Without dead ends: 698
[2021-10-28 23:15:40,004 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-10-28 23:15:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states.
[2021-10-28 23:15:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 685.
[2021-10-28 23:15:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 539 states have (on average 1.313543599257885) internal successors, (708), 548 states have internal predecessors, (708), 86 states have call successors, (86), 58 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118)
[2021-10-28 23:15:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 912 transitions.
[2021-10-28 23:15:40,034 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 912 transitions. Word has length 40
[2021-10-28 23:15:40,035 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:40,035 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 912 transitions.
[2021-10-28 23:15:40,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2021-10-28 23:15:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 912 transitions.
[2021-10-28 23:15:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2021-10-28 23:15:40,037 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:40,037 INFO L513 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]
[2021-10-28 23:15:40,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-28 23:15:40,038 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1411662583, now seen corresponding path program 1 times
[2021-10-28 23:15:40,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:40,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346790340]
[2021-10-28 23:15:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:40,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:15:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:15:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:40,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:40,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346790340]
[2021-10-28 23:15:40,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346790340] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:40,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:40,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:15:40,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981274604]
[2021-10-28 23:15:40,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:15:40,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:40,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:15:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:15:40,323 INFO L87 Difference]: Start difference. First operand 685 states and 912 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:15:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:41,771 INFO L93 Difference]: Finished difference Result 747 states and 988 transitions.
[2021-10-28 23:15:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-28 23:15:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41
[2021-10-28 23:15:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:41,777 INFO L225 Difference]: With dead ends: 747
[2021-10-28 23:15:41,777 INFO L226 Difference]: Without dead ends: 747
[2021-10-28 23:15:41,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:15:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states.
[2021-10-28 23:15:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718.
[2021-10-28 23:15:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3091872791519434) internal successors, (741), 578 states have internal predecessors, (741), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124)
[2021-10-28 23:15:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 951 transitions.
[2021-10-28 23:15:41,807 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 951 transitions. Word has length 41
[2021-10-28 23:15:41,808 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:41,808 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 951 transitions.
[2021-10-28 23:15:41,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:15:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 951 transitions.
[2021-10-28 23:15:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2021-10-28 23:15:41,810 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:41,810 INFO L513 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]
[2021-10-28 23:15:41,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-28 23:15:41,810 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash -359990476, now seen corresponding path program 1 times
[2021-10-28 23:15:41,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:41,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291846809]
[2021-10-28 23:15:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:41,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:41,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:42,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:15:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:42,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:15:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:42,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:42,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291846809]
[2021-10-28 23:15:42,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291846809] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:42,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:42,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:15:42,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847541814]
[2021-10-28 23:15:42,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:15:42,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:15:42,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:15:42,132 INFO L87 Difference]: Start difference. First operand 718 states and 951 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:15:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:43,922 INFO L93 Difference]: Finished difference Result 747 states and 987 transitions.
[2021-10-28 23:15:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:15:43,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42
[2021-10-28 23:15:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:43,928 INFO L225 Difference]: With dead ends: 747
[2021-10-28 23:15:43,928 INFO L226 Difference]: Without dead ends: 747
[2021-10-28 23:15:43,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306
[2021-10-28 23:15:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states.
[2021-10-28 23:15:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718.
[2021-10-28 23:15:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3074204946996466) internal successors, (740), 578 states have internal predecessors, (740), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124)
[2021-10-28 23:15:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 950 transitions.
[2021-10-28 23:15:43,956 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 950 transitions. Word has length 42
[2021-10-28 23:15:43,957 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:43,957 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 950 transitions.
[2021-10-28 23:15:43,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:15:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 950 transitions.
[2021-10-28 23:15:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2021-10-28 23:15:43,959 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:43,959 INFO L513 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]
[2021-10-28 23:15:43,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-28 23:15:43,959 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 864804566, now seen corresponding path program 1 times
[2021-10-28 23:15:43,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:43,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111727753]
[2021-10-28 23:15:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:43,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:44,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:44,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:15:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:15:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:44,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:44,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111727753]
[2021-10-28 23:15:44,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111727753] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:44,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:44,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:15:44,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391430584]
[2021-10-28 23:15:44,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:15:44,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:15:44,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:15:44,336 INFO L87 Difference]: Start difference. First operand 718 states and 950 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:15:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:45,730 INFO L93 Difference]: Finished difference Result 747 states and 986 transitions.
[2021-10-28 23:15:45,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:15:45,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43
[2021-10-28 23:15:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:45,736 INFO L225 Difference]: With dead ends: 747
[2021-10-28 23:15:45,736 INFO L226 Difference]: Without dead ends: 747
[2021-10-28 23:15:45,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306
[2021-10-28 23:15:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states.
[2021-10-28 23:15:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718.
[2021-10-28 23:15:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3056537102473498) internal successors, (739), 578 states have internal predecessors, (739), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124)
[2021-10-28 23:15:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 949 transitions.
[2021-10-28 23:15:45,775 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 949 transitions. Word has length 43
[2021-10-28 23:15:45,776 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:45,776 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 949 transitions.
[2021-10-28 23:15:45,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:15:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 949 transitions.
[2021-10-28 23:15:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2021-10-28 23:15:45,777 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:45,778 INFO L513 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]
[2021-10-28 23:15:45,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-28 23:15:45,778 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 484799798, now seen corresponding path program 1 times
[2021-10-28 23:15:45,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:45,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922473033]
[2021-10-28 23:15:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:45,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:45,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:45,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:45,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2021-10-28 23:15:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:45,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:45,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922473033]
[2021-10-28 23:15:45,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922473033] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:45,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:45,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-10-28 23:15:45,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668095458]
[2021-10-28 23:15:45,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-10-28 23:15:45,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-28 23:15:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2021-10-28 23:15:45,984 INFO L87 Difference]: Start difference. First operand 718 states and 949 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:15:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:47,549 INFO L93 Difference]: Finished difference Result 1090 states and 1456 transitions.
[2021-10-28 23:15:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:15:47,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44
[2021-10-28 23:15:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:47,557 INFO L225 Difference]: With dead ends: 1090
[2021-10-28 23:15:47,557 INFO L226 Difference]: Without dead ends: 1090
[2021-10-28 23:15:47,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:15:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states.
[2021-10-28 23:15:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 831.
[2021-10-28 23:15:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 657 states have (on average 1.3135464231354643) internal successors, (863), 671 states have internal predecessors, (863), 96 states have call successors, (96), 68 states have call predecessors, (96), 77 states have return successors, (144), 93 states have call predecessors, (144), 88 states have call successors, (144)
[2021-10-28 23:15:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1103 transitions.
[2021-10-28 23:15:47,593 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1103 transitions. Word has length 44
[2021-10-28 23:15:47,593 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:47,594 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1103 transitions.
[2021-10-28 23:15:47,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2021-10-28 23:15:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1103 transitions.
[2021-10-28 23:15:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2021-10-28 23:15:47,595 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:47,596 INFO L513 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]
[2021-10-28 23:15:47,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-28 23:15:47,596 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:47,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1122912541, now seen corresponding path program 1 times
[2021-10-28 23:15:47,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:47,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335303181]
[2021-10-28 23:15:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:47,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:47,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:15:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:15:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:47,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:47,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335303181]
[2021-10-28 23:15:47,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335303181] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:47,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:47,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:15:47,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969012477]
[2021-10-28 23:15:47,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:15:47,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:15:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:15:47,835 INFO L87 Difference]: Start difference. First operand 831 states and 1103 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:15:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:49,297 INFO L93 Difference]: Finished difference Result 871 states and 1151 transitions.
[2021-10-28 23:15:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-28 23:15:49,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44
[2021-10-28 23:15:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:49,304 INFO L225 Difference]: With dead ends: 871
[2021-10-28 23:15:49,305 INFO L226 Difference]: Without dead ends: 856
[2021-10-28 23:15:49,305 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:15:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states.
[2021-10-28 23:15:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 829.
[2021-10-28 23:15:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 656 states have (on average 1.3125) internal successors, (861), 670 states have internal predecessors, (861), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143)
[2021-10-28 23:15:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1099 transitions.
[2021-10-28 23:15:49,341 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1099 transitions. Word has length 44
[2021-10-28 23:15:49,341 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:49,342 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1099 transitions.
[2021-10-28 23:15:49,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:15:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1099 transitions.
[2021-10-28 23:15:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2021-10-28 23:15:49,343 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:49,344 INFO L513 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]
[2021-10-28 23:15:49,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-28 23:15:49,344 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1906062941, now seen corresponding path program 1 times
[2021-10-28 23:15:49,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:49,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010324307]
[2021-10-28 23:15:49,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:49,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2021-10-28 23:15:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:49,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:49,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010324307]
[2021-10-28 23:15:49,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010324307] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:49,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:49,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:15:49,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394878136]
[2021-10-28 23:15:49,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:15:49,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:15:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:15:49,725 INFO L87 Difference]: Start difference. First operand 829 states and 1099 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2021-10-28 23:15:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:51,441 INFO L93 Difference]: Finished difference Result 874 states and 1141 transitions.
[2021-10-28 23:15:51,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:15:51,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45
[2021-10-28 23:15:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:51,448 INFO L225 Difference]: With dead ends: 874
[2021-10-28 23:15:51,448 INFO L226 Difference]: Without dead ends: 874
[2021-10-28 23:15:51,448 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272
[2021-10-28 23:15:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states.
[2021-10-28 23:15:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820.
[2021-10-28 23:15:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 647 states have (on average 1.2982998454404946) internal successors, (840), 661 states have internal predecessors, (840), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143)
[2021-10-28 23:15:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1078 transitions.
[2021-10-28 23:15:51,479 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1078 transitions. Word has length 45
[2021-10-28 23:15:51,479 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:51,479 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1078 transitions.
[2021-10-28 23:15:51,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2021-10-28 23:15:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1078 transitions.
[2021-10-28 23:15:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2021-10-28 23:15:51,481 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:51,481 INFO L513 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]
[2021-10-28 23:15:51,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-10-28 23:15:51,482 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1924856002, now seen corresponding path program 1 times
[2021-10-28 23:15:51,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:51,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134971997]
[2021-10-28 23:15:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:51,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2021-10-28 23:15:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:51,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:51,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134971997]
[2021-10-28 23:15:51,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134971997] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:51,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:51,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:15:51,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544939471]
[2021-10-28 23:15:51,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:15:51,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:15:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:15:51,682 INFO L87 Difference]: Start difference. First operand 820 states and 1078 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2021-10-28 23:15:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:53,376 INFO L93 Difference]: Finished difference Result 580 states and 730 transitions.
[2021-10-28 23:15:53,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-10-28 23:15:53,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49
[2021-10-28 23:15:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:53,380 INFO L225 Difference]: With dead ends: 580
[2021-10-28 23:15:53,380 INFO L226 Difference]: Without dead ends: 580
[2021-10-28 23:15:53,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:15:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states.
[2021-10-28 23:15:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 528.
[2021-10-28 23:15:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 416 states have (on average 1.2740384615384615) internal successors, (530), 427 states have internal predecessors, (530), 62 states have call successors, (62), 43 states have call predecessors, (62), 49 states have return successors, (75), 59 states have call predecessors, (75), 54 states have call successors, (75)
[2021-10-28 23:15:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 667 transitions.
[2021-10-28 23:15:53,409 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 667 transitions. Word has length 49
[2021-10-28 23:15:53,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:53,410 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 667 transitions.
[2021-10-28 23:15:53,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2021-10-28 23:15:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 667 transitions.
[2021-10-28 23:15:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2021-10-28 23:15:53,412 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:53,412 INFO L513 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]
[2021-10-28 23:15:53,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-10-28 23:15:53,412 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:53,413 INFO L85 PathProgramCache]: Analyzing trace with hash -6834350, now seen corresponding path program 1 times
[2021-10-28 23:15:53,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:53,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304757954]
[2021-10-28 23:15:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:53,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:53,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:15:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:15:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2021-10-28 23:15:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:53,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:53,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304757954]
[2021-10-28 23:15:53,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304757954] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:53,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:53,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:15:53,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596143875]
[2021-10-28 23:15:53,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:15:53,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:53,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:15:53,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:15:53,633 INFO L87 Difference]: Start difference. First operand 528 states and 667 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:15:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:54,491 INFO L93 Difference]: Finished difference Result 569 states and 720 transitions.
[2021-10-28 23:15:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:15:54,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55
[2021-10-28 23:15:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:54,498 INFO L225 Difference]: With dead ends: 569
[2021-10-28 23:15:54,498 INFO L226 Difference]: Without dead ends: 569
[2021-10-28 23:15:54,499 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:15:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states.
[2021-10-28 23:15:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 542.
[2021-10-28 23:15:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.275058275058275) internal successors, (547), 440 states have internal predecessors, (547), 62 states have call successors, (62), 43 states have call predecessors, (62), 50 states have return successors, (78), 59 states have call predecessors, (78), 54 states have call successors, (78)
[2021-10-28 23:15:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 687 transitions.
[2021-10-28 23:15:54,516 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 687 transitions. Word has length 55
[2021-10-28 23:15:54,516 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:54,516 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 687 transitions.
[2021-10-28 23:15:54,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:15:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 687 transitions.
[2021-10-28 23:15:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2021-10-28 23:15:54,518 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:54,518 INFO L513 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]
[2021-10-28 23:15:54,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-10-28 23:15:54,518 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:54,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2114913751, now seen corresponding path program 1 times
[2021-10-28 23:15:54,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:54,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883614562]
[2021-10-28 23:15:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:54,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:15:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:15:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:54,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:54,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883614562]
[2021-10-28 23:15:54,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883614562] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:54,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:54,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:15:54,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740628489]
[2021-10-28 23:15:54,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:15:54,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:15:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:15:54,821 INFO L87 Difference]: Start difference. First operand 542 states and 687 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2021-10-28 23:15:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:57,077 INFO L93 Difference]: Finished difference Result 714 states and 903 transitions.
[2021-10-28 23:15:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2021-10-28 23:15:57,078 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52
[2021-10-28 23:15:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:57,081 INFO L225 Difference]: With dead ends: 714
[2021-10-28 23:15:57,082 INFO L226 Difference]: Without dead ends: 714
[2021-10-28 23:15:57,082 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650
[2021-10-28 23:15:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states.
[2021-10-28 23:15:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 571.
[2021-10-28 23:15:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 452 states have (on average 1.2676991150442478) internal successors, (573), 464 states have internal predecessors, (573), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83)
[2021-10-28 23:15:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 720 transitions.
[2021-10-28 23:15:57,105 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 720 transitions. Word has length 52
[2021-10-28 23:15:57,105 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:57,105 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 720 transitions.
[2021-10-28 23:15:57,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2021-10-28 23:15:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 720 transitions.
[2021-10-28 23:15:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2021-10-28 23:15:57,107 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:57,107 INFO L513 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]
[2021-10-28 23:15:57,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-10-28 23:15:57,108 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash -632991762, now seen corresponding path program 1 times
[2021-10-28 23:15:57,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:57,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854547574]
[2021-10-28 23:15:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:57,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:57,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:15:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:15:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:57,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:57,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854547574]
[2021-10-28 23:15:57,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854547574] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:57,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:57,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:15:57,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298542787]
[2021-10-28 23:15:57,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:15:57,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:15:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:15:57,346 INFO L87 Difference]: Start difference. First operand 571 states and 720 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:15:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:15:58,475 INFO L93 Difference]: Finished difference Result 638 states and 811 transitions.
[2021-10-28 23:15:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-28 23:15:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54
[2021-10-28 23:15:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:15:58,480 INFO L225 Difference]: With dead ends: 638
[2021-10-28 23:15:58,480 INFO L226 Difference]: Without dead ends: 638
[2021-10-28 23:15:58,481 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:15:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states.
[2021-10-28 23:15:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 583.
[2021-10-28 23:15:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 464 states have (on average 1.271551724137931) internal successors, (590), 476 states have internal predecessors, (590), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83)
[2021-10-28 23:15:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions.
[2021-10-28 23:15:58,502 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 54
[2021-10-28 23:15:58,502 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:15:58,503 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions.
[2021-10-28 23:15:58,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:15:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions.
[2021-10-28 23:15:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2021-10-28 23:15:58,505 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:15:58,505 INFO L513 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]
[2021-10-28 23:15:58,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-10-28 23:15:58,505 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:15:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:15:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2073627632, now seen corresponding path program 1 times
[2021-10-28 23:15:58,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:15:58,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725432256]
[2021-10-28 23:15:58,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:15:58,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:15:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:15:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:58,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:15:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:58,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:15:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:15:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:15:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:15:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:15:58,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:15:58,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725432256]
[2021-10-28 23:15:58,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725432256] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:15:58,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:15:58,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:15:58,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347038720]
[2021-10-28 23:15:58,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:15:58,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:15:58,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:15:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:15:58,806 INFO L87 Difference]: Start difference. First operand 583 states and 737 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2021-10-28 23:16:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:00,699 INFO L93 Difference]: Finished difference Result 611 states and 769 transitions.
[2021-10-28 23:16:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-10-28 23:16:00,700 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54
[2021-10-28 23:16:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:00,703 INFO L225 Difference]: With dead ends: 611
[2021-10-28 23:16:00,703 INFO L226 Difference]: Without dead ends: 611
[2021-10-28 23:16:00,704 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462
[2021-10-28 23:16:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states.
[2021-10-28 23:16:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 564.
[2021-10-28 23:16:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 447 states have (on average 1.2662192393736018) internal successors, (566), 459 states have internal predecessors, (566), 64 states have call successors, (64), 44 states have call predecessors, (64), 52 states have return successors, (81), 61 states have call predecessors, (81), 56 states have call successors, (81)
[2021-10-28 23:16:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 711 transitions.
[2021-10-28 23:16:00,725 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 711 transitions. Word has length 54
[2021-10-28 23:16:00,725 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:00,725 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 711 transitions.
[2021-10-28 23:16:00,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2021-10-28 23:16:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 711 transitions.
[2021-10-28 23:16:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2021-10-28 23:16:00,727 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:00,728 INFO L513 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]
[2021-10-28 23:16:00,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-10-28 23:16:00,728 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2078060306, now seen corresponding path program 1 times
[2021-10-28 23:16:00,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:00,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650371970]
[2021-10-28 23:16:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:00,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:00,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:16:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:01,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:01,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650371970]
[2021-10-28 23:16:01,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650371970] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:01,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:01,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-10-28 23:16:01,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260199527]
[2021-10-28 23:16:01,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-28 23:16:01,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-28 23:16:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-10-28 23:16:01,006 INFO L87 Difference]: Start difference. First operand 564 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:02,672 INFO L93 Difference]: Finished difference Result 666 states and 840 transitions.
[2021-10-28 23:16:02,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-28 23:16:02,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54
[2021-10-28 23:16:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:02,677 INFO L225 Difference]: With dead ends: 666
[2021-10-28 23:16:02,677 INFO L226 Difference]: Without dead ends: 666
[2021-10-28 23:16:02,678 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:16:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states.
[2021-10-28 23:16:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 580.
[2021-10-28 23:16:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 461 states have (on average 1.2668112798264641) internal successors, (584), 473 states have internal predecessors, (584), 64 states have call successors, (64), 45 states have call predecessors, (64), 54 states have return successors, (85), 62 states have call predecessors, (85), 57 states have call successors, (85)
[2021-10-28 23:16:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 733 transitions.
[2021-10-28 23:16:02,698 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 733 transitions. Word has length 54
[2021-10-28 23:16:02,699 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:02,699 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 733 transitions.
[2021-10-28 23:16:02,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 733 transitions.
[2021-10-28 23:16:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2021-10-28 23:16:02,704 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:02,704 INFO L513 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]
[2021-10-28 23:16:02,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-10-28 23:16:02,704 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:02,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2007283295, now seen corresponding path program 1 times
[2021-10-28 23:16:02,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:02,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105327480]
[2021-10-28 23:16:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:02,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:02,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:16:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:03,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:03,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105327480]
[2021-10-28 23:16:03,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105327480] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:03,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:03,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:16:03,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836513508]
[2021-10-28 23:16:03,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:16:03,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:03,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:16:03,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:16:03,055 INFO L87 Difference]: Start difference. First operand 580 states and 733 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:16:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:04,300 INFO L93 Difference]: Finished difference Result 544 states and 676 transitions.
[2021-10-28 23:16:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-28 23:16:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61
[2021-10-28 23:16:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:04,303 INFO L225 Difference]: With dead ends: 544
[2021-10-28 23:16:04,303 INFO L226 Difference]: Without dead ends: 544
[2021-10-28 23:16:04,303 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:16:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states.
[2021-10-28 23:16:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 506.
[2021-10-28 23:16:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 398 states have (on average 1.2487437185929648) internal successors, (497), 406 states have internal predecessors, (497), 60 states have call successors, (60), 43 states have call predecessors, (60), 47 states have return successors, (70), 57 states have call predecessors, (70), 54 states have call successors, (70)
[2021-10-28 23:16:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 627 transitions.
[2021-10-28 23:16:04,321 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 627 transitions. Word has length 61
[2021-10-28 23:16:04,321 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:04,321 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 627 transitions.
[2021-10-28 23:16:04,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6)
[2021-10-28 23:16:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 627 transitions.
[2021-10-28 23:16:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2021-10-28 23:16:04,323 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:04,323 INFO L513 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]
[2021-10-28 23:16:04,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-10-28 23:16:04,324 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:04,324 INFO L85 PathProgramCache]: Analyzing trace with hash 456516591, now seen corresponding path program 1 times
[2021-10-28 23:16:04,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:04,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207095430]
[2021-10-28 23:16:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:04,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:04,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:16:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:04,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:04,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207095430]
[2021-10-28 23:16:04,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207095430] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:04,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:04,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-10-28 23:16:04,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016652260]
[2021-10-28 23:16:04,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-10-28 23:16:04,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-10-28 23:16:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:16:04,681 INFO L87 Difference]: Start difference. First operand 506 states and 627 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:06,023 INFO L93 Difference]: Finished difference Result 568 states and 708 transitions.
[2021-10-28 23:16:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:06,024 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55
[2021-10-28 23:16:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:06,027 INFO L225 Difference]: With dead ends: 568
[2021-10-28 23:16:06,027 INFO L226 Difference]: Without dead ends: 567
[2021-10-28 23:16:06,027 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states.
[2021-10-28 23:16:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 523.
[2021-10-28 23:16:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 413 states have (on average 1.2397094430992737) internal successors, (512), 421 states have internal predecessors, (512), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (77), 59 states have call predecessors, (77), 54 states have call successors, (77)
[2021-10-28 23:16:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions.
[2021-10-28 23:16:06,043 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 55
[2021-10-28 23:16:06,043 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:06,043 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions.
[2021-10-28 23:16:06,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions.
[2021-10-28 23:16:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2021-10-28 23:16:06,045 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:06,045 INFO L513 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]
[2021-10-28 23:16:06,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-10-28 23:16:06,046 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash 456793421, now seen corresponding path program 1 times
[2021-10-28 23:16:06,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:06,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505577379]
[2021-10-28 23:16:06,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:06,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:06,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:06,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:16:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:06,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:06,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505577379]
[2021-10-28 23:16:06,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505577379] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:06,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:06,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-10-28 23:16:06,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080124562]
[2021-10-28 23:16:06,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-10-28 23:16:06,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:06,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-10-28 23:16:06,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:16:06,348 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:07,478 INFO L93 Difference]: Finished difference Result 563 states and 696 transitions.
[2021-10-28 23:16:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:16:07,479 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55
[2021-10-28 23:16:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:07,482 INFO L225 Difference]: With dead ends: 563
[2021-10-28 23:16:07,482 INFO L226 Difference]: Without dead ends: 551
[2021-10-28 23:16:07,483 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states.
[2021-10-28 23:16:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 520.
[2021-10-28 23:16:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 410 states have (on average 1.2414634146341463) internal successors, (509), 419 states have internal predecessors, (509), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (76), 58 states have call predecessors, (76), 54 states have call successors, (76)
[2021-10-28 23:16:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 645 transitions.
[2021-10-28 23:16:07,499 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 645 transitions. Word has length 55
[2021-10-28 23:16:07,499 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:07,499 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 645 transitions.
[2021-10-28 23:16:07,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 645 transitions.
[2021-10-28 23:16:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2021-10-28 23:16:07,502 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:07,503 INFO L513 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]
[2021-10-28 23:16:07,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-10-28 23:16:07,503 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1713148089, now seen corresponding path program 1 times
[2021-10-28 23:16:07,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:07,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684883532]
[2021-10-28 23:16:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:07,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:16:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2021-10-28 23:16:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:07,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:07,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684883532]
[2021-10-28 23:16:07,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684883532] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:07,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:07,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:16:07,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979667905]
[2021-10-28 23:16:07,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:16:07,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:16:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:16:07,792 INFO L87 Difference]: Start difference. First operand 520 states and 645 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6)
[2021-10-28 23:16:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:09,412 INFO L93 Difference]: Finished difference Result 563 states and 695 transitions.
[2021-10-28 23:16:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:16:09,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57
[2021-10-28 23:16:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:09,416 INFO L225 Difference]: With dead ends: 563
[2021-10-28 23:16:09,416 INFO L226 Difference]: Without dead ends: 523
[2021-10-28 23:16:09,416 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states.
[2021-10-28 23:16:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496.
[2021-10-28 23:16:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 392 states have (on average 1.2372448979591837) internal successors, (485), 400 states have internal predecessors, (485), 58 states have call successors, (58), 41 states have call predecessors, (58), 45 states have return successors, (72), 55 states have call predecessors, (72), 52 states have call successors, (72)
[2021-10-28 23:16:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 615 transitions.
[2021-10-28 23:16:09,432 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 615 transitions. Word has length 57
[2021-10-28 23:16:09,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:09,432 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 615 transitions.
[2021-10-28 23:16:09,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6)
[2021-10-28 23:16:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 615 transitions.
[2021-10-28 23:16:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2021-10-28 23:16:09,434 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:09,434 INFO L513 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]
[2021-10-28 23:16:09,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-10-28 23:16:09,435 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash 471512753, now seen corresponding path program 1 times
[2021-10-28 23:16:09,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:09,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764832681]
[2021-10-28 23:16:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:09,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:09,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:09,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2021-10-28 23:16:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:09,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:09,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764832681]
[2021-10-28 23:16:09,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764832681] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:09,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:09,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:16:09,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585852029]
[2021-10-28 23:16:09,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:16:09,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:16:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:16:09,712 INFO L87 Difference]: Start difference. First operand 496 states and 615 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:16:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:11,047 INFO L93 Difference]: Finished difference Result 527 states and 650 transitions.
[2021-10-28 23:16:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56
[2021-10-28 23:16:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:11,051 INFO L225 Difference]: With dead ends: 527
[2021-10-28 23:16:11,051 INFO L226 Difference]: Without dead ends: 513
[2021-10-28 23:16:11,051 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272
[2021-10-28 23:16:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states.
[2021-10-28 23:16:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 478.
[2021-10-28 23:16:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2413793103448276) internal successors, (468), 384 states have internal predecessors, (468), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65)
[2021-10-28 23:16:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 590 transitions.
[2021-10-28 23:16:11,065 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 590 transitions. Word has length 56
[2021-10-28 23:16:11,065 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:11,066 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 590 transitions.
[2021-10-28 23:16:11,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2021-10-28 23:16:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 590 transitions.
[2021-10-28 23:16:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2021-10-28 23:16:11,067 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:11,068 INFO L513 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]
[2021-10-28 23:16:11,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2021-10-28 23:16:11,068 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -70909626, now seen corresponding path program 1 times
[2021-10-28 23:16:11,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:11,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208678699]
[2021-10-28 23:16:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:11,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:16:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:11,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:11,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208678699]
[2021-10-28 23:16:11,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208678699] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:11,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:11,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:16:11,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101192631]
[2021-10-28 23:16:11,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:16:11,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:16:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:16:11,371 INFO L87 Difference]: Start difference. First operand 478 states and 590 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:16:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:12,945 INFO L93 Difference]: Finished difference Result 511 states and 631 transitions.
[2021-10-28 23:16:12,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:16:12,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65
[2021-10-28 23:16:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:12,948 INFO L225 Difference]: With dead ends: 511
[2021-10-28 23:16:12,949 INFO L226 Difference]: Without dead ends: 511
[2021-10-28 23:16:12,949 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420
[2021-10-28 23:16:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states.
[2021-10-28 23:16:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 478.
[2021-10-28 23:16:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2360742705570291) internal successors, (466), 384 states have internal predecessors, (466), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65)
[2021-10-28 23:16:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 588 transitions.
[2021-10-28 23:16:12,963 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 588 transitions. Word has length 65
[2021-10-28 23:16:12,964 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:12,964 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 588 transitions.
[2021-10-28 23:16:12,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:16:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 588 transitions.
[2021-10-28 23:16:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2021-10-28 23:16:12,966 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:12,966 INFO L513 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]
[2021-10-28 23:16:12,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2021-10-28 23:16:12,966 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash -876554703, now seen corresponding path program 1 times
[2021-10-28 23:16:12,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:12,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362617587]
[2021-10-28 23:16:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:12,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:13,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:13,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362617587]
[2021-10-28 23:16:13,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362617587] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:13,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:13,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:16:13,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841595717]
[2021-10-28 23:16:13,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:16:13,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:16:13,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:13,251 INFO L87 Difference]: Start difference. First operand 478 states and 588 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:14,440 INFO L93 Difference]: Finished difference Result 519 states and 636 transitions.
[2021-10-28 23:16:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60
[2021-10-28 23:16:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:14,443 INFO L225 Difference]: With dead ends: 519
[2021-10-28 23:16:14,444 INFO L226 Difference]: Without dead ends: 501
[2021-10-28 23:16:14,444 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states.
[2021-10-28 23:16:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 474.
[2021-10-28 23:16:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2352941176470589) internal successors, (462), 381 states have internal predecessors, (462), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64)
[2021-10-28 23:16:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 582 transitions.
[2021-10-28 23:16:14,457 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 582 transitions. Word has length 60
[2021-10-28 23:16:14,458 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:14,458 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 582 transitions.
[2021-10-28 23:16:14,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 582 transitions.
[2021-10-28 23:16:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2021-10-28 23:16:14,460 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:14,460 INFO L513 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]
[2021-10-28 23:16:14,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2021-10-28 23:16:14,460 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -863080833, now seen corresponding path program 1 times
[2021-10-28 23:16:14,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:14,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085992702]
[2021-10-28 23:16:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:14,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:16:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:14,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:14,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085992702]
[2021-10-28 23:16:14,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085992702] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:14,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:14,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:16:14,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711588402]
[2021-10-28 23:16:14,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:16:14,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:14,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:16:14,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:16:14,781 INFO L87 Difference]: Start difference. First operand 474 states and 582 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7)
[2021-10-28 23:16:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:15,877 INFO L93 Difference]: Finished difference Result 526 states and 647 transitions.
[2021-10-28 23:16:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-10-28 23:16:15,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68
[2021-10-28 23:16:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:15,880 INFO L225 Difference]: With dead ends: 526
[2021-10-28 23:16:15,880 INFO L226 Difference]: Without dead ends: 526
[2021-10-28 23:16:15,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2021-10-28 23:16:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 474.
[2021-10-28 23:16:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2299465240641712) internal successors, (460), 381 states have internal predecessors, (460), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64)
[2021-10-28 23:16:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 580 transitions.
[2021-10-28 23:16:15,893 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 580 transitions. Word has length 68
[2021-10-28 23:16:15,893 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:15,893 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 580 transitions.
[2021-10-28 23:16:15,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7)
[2021-10-28 23:16:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 580 transitions.
[2021-10-28 23:16:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2021-10-28 23:16:15,895 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:15,895 INFO L513 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]
[2021-10-28 23:16:15,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2021-10-28 23:16:15,896 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1815591607, now seen corresponding path program 1 times
[2021-10-28 23:16:15,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:15,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263909054]
[2021-10-28 23:16:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:15,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:16,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:16,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:16,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263909054]
[2021-10-28 23:16:16,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263909054] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:16,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:16,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:16:16,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872600067]
[2021-10-28 23:16:16,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:16:16,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:16:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:16,165 INFO L87 Difference]: Start difference. First operand 474 states and 580 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:17,303 INFO L93 Difference]: Finished difference Result 515 states and 628 transitions.
[2021-10-28 23:16:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:17,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61
[2021-10-28 23:16:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:17,307 INFO L225 Difference]: With dead ends: 515
[2021-10-28 23:16:17,307 INFO L226 Difference]: Without dead ends: 496
[2021-10-28 23:16:17,307 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states.
[2021-10-28 23:16:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 469.
[2021-10-28 23:16:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 370 states have (on average 1.2297297297297298) internal successors, (455), 377 states have internal predecessors, (455), 55 states have call successors, (55), 41 states have call predecessors, (55), 43 states have return successors, (63), 51 states have call predecessors, (63), 49 states have call successors, (63)
[2021-10-28 23:16:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 573 transitions.
[2021-10-28 23:16:17,320 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 573 transitions. Word has length 61
[2021-10-28 23:16:17,320 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:17,320 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 573 transitions.
[2021-10-28 23:16:17,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 573 transitions.
[2021-10-28 23:16:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2021-10-28 23:16:17,322 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:17,322 INFO L513 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]
[2021-10-28 23:16:17,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2021-10-28 23:16:17,322 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1549264219, now seen corresponding path program 1 times
[2021-10-28 23:16:17,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:17,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310746096]
[2021-10-28 23:16:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:17,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:17,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:17,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:17,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310746096]
[2021-10-28 23:16:17,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310746096] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:17,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:17,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:16:17,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109398805]
[2021-10-28 23:16:17,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:16:17,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:16:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:17,599 INFO L87 Difference]: Start difference. First operand 469 states and 573 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:18,604 INFO L93 Difference]: Finished difference Result 510 states and 621 transitions.
[2021-10-28 23:16:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61
[2021-10-28 23:16:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:18,607 INFO L225 Difference]: With dead ends: 510
[2021-10-28 23:16:18,607 INFO L226 Difference]: Without dead ends: 492
[2021-10-28 23:16:18,607 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states.
[2021-10-28 23:16:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 465.
[2021-10-28 23:16:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 367 states have (on average 1.228882833787466) internal successors, (451), 374 states have internal predecessors, (451), 54 states have call successors, (54), 41 states have call predecessors, (54), 43 states have return successors, (62), 50 states have call predecessors, (62), 48 states have call successors, (62)
[2021-10-28 23:16:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 567 transitions.
[2021-10-28 23:16:18,620 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 567 transitions. Word has length 61
[2021-10-28 23:16:18,620 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:18,621 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 567 transitions.
[2021-10-28 23:16:18,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 567 transitions.
[2021-10-28 23:16:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2021-10-28 23:16:18,623 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:18,623 INFO L513 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]
[2021-10-28 23:16:18,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2021-10-28 23:16:18,623 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1654833550, now seen corresponding path program 1 times
[2021-10-28 23:16:18,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:18,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084141389]
[2021-10-28 23:16:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:18,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2021-10-28 23:16:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:18,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:18,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084141389]
[2021-10-28 23:16:18,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084141389] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:18,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:18,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-10-28 23:16:18,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809861947]
[2021-10-28 23:16:18,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-10-28 23:16:18,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-10-28 23:16:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2021-10-28 23:16:18,881 INFO L87 Difference]: Start difference. First operand 465 states and 567 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:16:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:19,882 INFO L93 Difference]: Finished difference Result 636 states and 773 transitions.
[2021-10-28 23:16:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:16:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67
[2021-10-28 23:16:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:19,886 INFO L225 Difference]: With dead ends: 636
[2021-10-28 23:16:19,886 INFO L226 Difference]: Without dead ends: 636
[2021-10-28 23:16:19,887 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156
[2021-10-28 23:16:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states.
[2021-10-28 23:16:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 586.
[2021-10-28 23:16:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 460 states have (on average 1.2195652173913043) internal successors, (561), 469 states have internal predecessors, (561), 67 states have call successors, (67), 51 states have call predecessors, (67), 58 states have return successors, (87), 66 states have call predecessors, (87), 62 states have call successors, (87)
[2021-10-28 23:16:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 715 transitions.
[2021-10-28 23:16:19,903 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 715 transitions. Word has length 67
[2021-10-28 23:16:19,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:19,903 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 715 transitions.
[2021-10-28 23:16:19,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:16:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 715 transitions.
[2021-10-28 23:16:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2021-10-28 23:16:19,905 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:19,905 INFO L513 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]
[2021-10-28 23:16:19,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2021-10-28 23:16:19,906 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2014934282, now seen corresponding path program 1 times
[2021-10-28 23:16:19,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:19,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546303446]
[2021-10-28 23:16:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:19,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:20,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2021-10-28 23:16:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:20,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:20,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546303446]
[2021-10-28 23:16:20,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546303446] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:20,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:20,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:16:20,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45092246]
[2021-10-28 23:16:20,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:16:20,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:16:20,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:20,231 INFO L87 Difference]: Start difference. First operand 586 states and 715 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:21,593 INFO L93 Difference]: Finished difference Result 627 states and 764 transitions.
[2021-10-28 23:16:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 65
[2021-10-28 23:16:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:21,597 INFO L225 Difference]: With dead ends: 627
[2021-10-28 23:16:21,597 INFO L226 Difference]: Without dead ends: 587
[2021-10-28 23:16:21,597 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states.
[2021-10-28 23:16:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 560.
[2021-10-28 23:16:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 439 states have (on average 1.2186788154897494) internal successors, (535), 448 states have internal predecessors, (535), 64 states have call successors, (64), 49 states have call predecessors, (64), 56 states have return successors, (84), 63 states have call predecessors, (84), 59 states have call successors, (84)
[2021-10-28 23:16:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 683 transitions.
[2021-10-28 23:16:21,614 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 683 transitions. Word has length 65
[2021-10-28 23:16:21,614 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:21,614 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 683 transitions.
[2021-10-28 23:16:21,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2021-10-28 23:16:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 683 transitions.
[2021-10-28 23:16:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-10-28 23:16:21,617 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:21,617 INFO L513 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]
[2021-10-28 23:16:21,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2021-10-28 23:16:21,618 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1554016619, now seen corresponding path program 1 times
[2021-10-28 23:16:21,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:21,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804450868]
[2021-10-28 23:16:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:21,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:16:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2021-10-28 23:16:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:21,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:21,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804450868]
[2021-10-28 23:16:21,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804450868] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:21,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:21,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:16:21,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927265433]
[2021-10-28 23:16:21,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:16:21,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:21,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:16:21,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:16:21,957 INFO L87 Difference]: Start difference. First operand 560 states and 683 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2021-10-28 23:16:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:23,632 INFO L93 Difference]: Finished difference Result 575 states and 695 transitions.
[2021-10-28 23:16:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2021-10-28 23:16:23,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79
[2021-10-28 23:16:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:23,635 INFO L225 Difference]: With dead ends: 575
[2021-10-28 23:16:23,635 INFO L226 Difference]: Without dead ends: 575
[2021-10-28 23:16:23,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702
[2021-10-28 23:16:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states.
[2021-10-28 23:16:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 542.
[2021-10-28 23:16:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 425 states have (on average 1.2188235294117646) internal successors, (518), 433 states have internal predecessors, (518), 62 states have call successors, (62), 49 states have call predecessors, (62), 54 states have return successors, (73), 60 states have call predecessors, (73), 57 states have call successors, (73)
[2021-10-28 23:16:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 653 transitions.
[2021-10-28 23:16:23,651 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 653 transitions. Word has length 79
[2021-10-28 23:16:23,652 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:23,652 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 653 transitions.
[2021-10-28 23:16:23,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2021-10-28 23:16:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 653 transitions.
[2021-10-28 23:16:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-10-28 23:16:23,654 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:23,655 INFO L513 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]
[2021-10-28 23:16:23,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2021-10-28 23:16:23,655 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -478221177, now seen corresponding path program 1 times
[2021-10-28 23:16:23,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:23,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132424280]
[2021-10-28 23:16:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:23,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2021-10-28 23:16:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2021-10-28 23:16:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:24,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:24,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:24,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132424280]
[2021-10-28 23:16:24,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132424280] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:24,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:24,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:16:24,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031586176]
[2021-10-28 23:16:24,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:16:24,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:16:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:24,014 INFO L87 Difference]: Start difference. First operand 542 states and 653 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9)
[2021-10-28 23:16:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:25,295 INFO L93 Difference]: Finished difference Result 651 states and 821 transitions.
[2021-10-28 23:16:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2021-10-28 23:16:25,297 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80
[2021-10-28 23:16:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:25,300 INFO L225 Difference]: With dead ends: 651
[2021-10-28 23:16:25,300 INFO L226 Difference]: Without dead ends: 651
[2021-10-28 23:16:25,300 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506
[2021-10-28 23:16:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states.
[2021-10-28 23:16:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 506.
[2021-10-28 23:16:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 401 states have (on average 1.2194513715710724) internal successors, (489), 407 states have internal predecessors, (489), 55 states have call successors, (55), 43 states have call predecessors, (55), 49 states have return successors, (63), 56 states have call predecessors, (63), 51 states have call successors, (63)
[2021-10-28 23:16:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 607 transitions.
[2021-10-28 23:16:25,317 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 607 transitions. Word has length 80
[2021-10-28 23:16:25,317 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:25,317 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 607 transitions.
[2021-10-28 23:16:25,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9)
[2021-10-28 23:16:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 607 transitions.
[2021-10-28 23:16:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-10-28 23:16:25,320 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:25,320 INFO L513 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]
[2021-10-28 23:16:25,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2021-10-28 23:16:25,321 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -998039197, now seen corresponding path program 1 times
[2021-10-28 23:16:25,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:25,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026998793]
[2021-10-28 23:16:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:25,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2021-10-28 23:16:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:25,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:25,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026998793]
[2021-10-28 23:16:25,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026998793] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:25,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:25,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-10-28 23:16:25,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501782051]
[2021-10-28 23:16:25,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-10-28 23:16:25,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:25,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-10-28 23:16:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:25,709 INFO L87 Difference]: Start difference. First operand 506 states and 607 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9)
[2021-10-28 23:16:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:27,119 INFO L93 Difference]: Finished difference Result 581 states and 696 transitions.
[2021-10-28 23:16:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2021-10-28 23:16:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85
[2021-10-28 23:16:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:27,126 INFO L225 Difference]: With dead ends: 581
[2021-10-28 23:16:27,126 INFO L226 Difference]: Without dead ends: 563
[2021-10-28 23:16:27,127 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600
[2021-10-28 23:16:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states.
[2021-10-28 23:16:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 514.
[2021-10-28 23:16:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 408 states have (on average 1.2156862745098038) internal successors, (496), 414 states have internal predecessors, (496), 55 states have call successors, (55), 43 states have call predecessors, (55), 50 states have return successors, (66), 57 states have call predecessors, (66), 51 states have call successors, (66)
[2021-10-28 23:16:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 617 transitions.
[2021-10-28 23:16:27,143 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 617 transitions. Word has length 85
[2021-10-28 23:16:27,145 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:27,145 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 617 transitions.
[2021-10-28 23:16:27,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9)
[2021-10-28 23:16:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 617 transitions.
[2021-10-28 23:16:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-10-28 23:16:27,148 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:27,148 INFO L513 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]
[2021-10-28 23:16:27,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2021-10-28 23:16:27,149 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2056891224, now seen corresponding path program 1 times
[2021-10-28 23:16:27,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:27,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071733832]
[2021-10-28 23:16:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:27,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:16:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2021-10-28 23:16:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:27,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:27,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071733832]
[2021-10-28 23:16:27,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071733832] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:27,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:27,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-10-28 23:16:27,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579650505]
[2021-10-28 23:16:27,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-10-28 23:16:27,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-10-28 23:16:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2021-10-28 23:16:27,466 INFO L87 Difference]: Start difference. First operand 514 states and 617 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2021-10-28 23:16:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:29,059 INFO L93 Difference]: Finished difference Result 667 states and 781 transitions.
[2021-10-28 23:16:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-10-28 23:16:29,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 80
[2021-10-28 23:16:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:29,064 INFO L225 Difference]: With dead ends: 667
[2021-10-28 23:16:29,064 INFO L226 Difference]: Without dead ends: 667
[2021-10-28 23:16:29,064 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462
[2021-10-28 23:16:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states.
[2021-10-28 23:16:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 635.
[2021-10-28 23:16:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 505 states have (on average 1.205940594059406) internal successors, (609), 513 states have internal predecessors, (609), 63 states have call successors, (63), 55 states have call predecessors, (63), 66 states have return successors, (77), 67 states have call predecessors, (77), 59 states have call successors, (77)
[2021-10-28 23:16:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 749 transitions.
[2021-10-28 23:16:29,084 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 749 transitions. Word has length 80
[2021-10-28 23:16:29,084 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:29,084 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 749 transitions.
[2021-10-28 23:16:29,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2021-10-28 23:16:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 749 transitions.
[2021-10-28 23:16:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2021-10-28 23:16:29,087 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:29,087 INFO L513 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]
[2021-10-28 23:16:29,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2021-10-28 23:16:29,088 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1814178751, now seen corresponding path program 1 times
[2021-10-28 23:16:29,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:29,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395462880]
[2021-10-28 23:16:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:29,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2021-10-28 23:16:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:29,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:29,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395462880]
[2021-10-28 23:16:29,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395462880] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:29,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:29,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-10-28 23:16:29,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857811649]
[2021-10-28 23:16:29,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-10-28 23:16:29,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-10-28 23:16:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:29,486 INFO L87 Difference]: Start difference. First operand 635 states and 749 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9)
[2021-10-28 23:16:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:30,852 INFO L93 Difference]: Finished difference Result 682 states and 798 transitions.
[2021-10-28 23:16:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-10-28 23:16:30,853 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86
[2021-10-28 23:16:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:30,856 INFO L225 Difference]: With dead ends: 682
[2021-10-28 23:16:30,857 INFO L226 Difference]: Without dead ends: 664
[2021-10-28 23:16:30,857 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420
[2021-10-28 23:16:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states.
[2021-10-28 23:16:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 627.
[2021-10-28 23:16:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 498 states have (on average 1.2068273092369477) internal successors, (601), 506 states have internal predecessors, (601), 63 states have call successors, (63), 55 states have call predecessors, (63), 65 states have return successors, (75), 66 states have call predecessors, (75), 59 states have call successors, (75)
[2021-10-28 23:16:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 739 transitions.
[2021-10-28 23:16:30,875 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 739 transitions. Word has length 86
[2021-10-28 23:16:30,875 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:30,875 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 739 transitions.
[2021-10-28 23:16:30,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9)
[2021-10-28 23:16:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 739 transitions.
[2021-10-28 23:16:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-10-28 23:16:30,877 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:30,878 INFO L513 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]
[2021-10-28 23:16:30,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2021-10-28 23:16:30,878 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1760569352, now seen corresponding path program 1 times
[2021-10-28 23:16:30,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:30,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210391759]
[2021-10-28 23:16:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:30,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:16:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2021-10-28 23:16:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:31,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:31,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210391759]
[2021-10-28 23:16:31,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210391759] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:31,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:31,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-10-28 23:16:31,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062976955]
[2021-10-28 23:16:31,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-10-28 23:16:31,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:31,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-10-28 23:16:31,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2021-10-28 23:16:31,152 INFO L87 Difference]: Start difference. First operand 627 states and 739 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:16:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:32,057 INFO L93 Difference]: Finished difference Result 634 states and 743 transitions.
[2021-10-28 23:16:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:32,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81
[2021-10-28 23:16:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:32,060 INFO L225 Difference]: With dead ends: 634
[2021-10-28 23:16:32,060 INFO L226 Difference]: Without dead ends: 581
[2021-10-28 23:16:32,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states.
[2021-10-28 23:16:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579.
[2021-10-28 23:16:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 456 states have (on average 1.206140350877193) internal successors, (550), 464 states have internal predecessors, (550), 61 states have call successors, (61), 53 states have call predecessors, (61), 61 states have return successors, (71), 62 states have call predecessors, (71), 57 states have call successors, (71)
[2021-10-28 23:16:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 682 transitions.
[2021-10-28 23:16:32,086 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 682 transitions. Word has length 81
[2021-10-28 23:16:32,086 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:32,086 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 682 transitions.
[2021-10-28 23:16:32,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2021-10-28 23:16:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 682 transitions.
[2021-10-28 23:16:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2021-10-28 23:16:32,089 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:32,089 INFO L513 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]
[2021-10-28 23:16:32,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2021-10-28 23:16:32,090 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1681688182, now seen corresponding path program 1 times
[2021-10-28 23:16:32,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:32,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910901293]
[2021-10-28 23:16:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:32,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2021-10-28 23:16:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2021-10-28 23:16:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2021-10-28 23:16:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:32,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:32,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910901293]
[2021-10-28 23:16:32,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910901293] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:32,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:32,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-10-28 23:16:32,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117843118]
[2021-10-28 23:16:32,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-10-28 23:16:32,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-10-28 23:16:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:32,494 INFO L87 Difference]: Start difference. First operand 579 states and 682 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8)
[2021-10-28 23:16:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:33,830 INFO L93 Difference]: Finished difference Result 580 states and 682 transitions.
[2021-10-28 23:16:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-10-28 23:16:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 90
[2021-10-28 23:16:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:33,833 INFO L225 Difference]: With dead ends: 580
[2021-10-28 23:16:33,834 INFO L226 Difference]: Without dead ends: 495
[2021-10-28 23:16:33,834 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462
[2021-10-28 23:16:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states.
[2021-10-28 23:16:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493.
[2021-10-28 23:16:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 384 states have (on average 1.2083333333333333) internal successors, (464), 391 states have internal predecessors, (464), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64)
[2021-10-28 23:16:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 582 transitions.
[2021-10-28 23:16:33,847 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 582 transitions. Word has length 90
[2021-10-28 23:16:33,848 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:33,848 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 582 transitions.
[2021-10-28 23:16:33,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8)
[2021-10-28 23:16:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 582 transitions.
[2021-10-28 23:16:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2021-10-28 23:16:33,850 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:33,851 INFO L513 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]
[2021-10-28 23:16:33,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2021-10-28 23:16:33,851 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1266916623, now seen corresponding path program 1 times
[2021-10-28 23:16:33,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:33,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594644656]
[2021-10-28 23:16:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:33,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2021-10-28 23:16:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2021-10-28 23:16:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:34,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:34,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594644656]
[2021-10-28 23:16:34,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594644656] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:34,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:34,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:16:34,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084198656]
[2021-10-28 23:16:34,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:16:34,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:16:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:34,187 INFO L87 Difference]: Start difference. First operand 493 states and 582 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10)
[2021-10-28 23:16:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:34,656 INFO L93 Difference]: Finished difference Result 491 states and 577 transitions.
[2021-10-28 23:16:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-10-28 23:16:34,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96
[2021-10-28 23:16:34,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:34,659 INFO L225 Difference]: With dead ends: 491
[2021-10-28 23:16:34,660 INFO L226 Difference]: Without dead ends: 489
[2021-10-28 23:16:34,660 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240
[2021-10-28 23:16:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states.
[2021-10-28 23:16:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 436.
[2021-10-28 23:16:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 340 states have (on average 1.1970588235294117) internal successors, (407), 346 states have internal predecessors, (407), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55)
[2021-10-28 23:16:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 509 transitions.
[2021-10-28 23:16:34,673 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 509 transitions. Word has length 96
[2021-10-28 23:16:34,674 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:34,674 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 509 transitions.
[2021-10-28 23:16:34,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10)
[2021-10-28 23:16:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 509 transitions.
[2021-10-28 23:16:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2021-10-28 23:16:34,676 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:34,677 INFO L513 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]
[2021-10-28 23:16:34,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2021-10-28 23:16:34,677 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:34,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash -596239754, now seen corresponding path program 1 times
[2021-10-28 23:16:34,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:34,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945864830]
[2021-10-28 23:16:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:34,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:35,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:35,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2021-10-28 23:16:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:35,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2021-10-28 23:16:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:35,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:35,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945864830]
[2021-10-28 23:16:35,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945864830] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:35,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:35,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:16:35,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323456435]
[2021-10-28 23:16:35,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:16:35,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:16:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:16:35,102 INFO L87 Difference]: Start difference. First operand 436 states and 509 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10)
[2021-10-28 23:16:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:36,397 INFO L93 Difference]: Finished difference Result 833 states and 977 transitions.
[2021-10-28 23:16:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2021-10-28 23:16:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96
[2021-10-28 23:16:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:36,401 INFO L225 Difference]: With dead ends: 833
[2021-10-28 23:16:36,401 INFO L226 Difference]: Without dead ends: 791
[2021-10-28 23:16:36,401 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756
[2021-10-28 23:16:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states.
[2021-10-28 23:16:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 416.
[2021-10-28 23:16:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 324 states have (on average 1.1975308641975309) internal successors, (388), 329 states have internal predecessors, (388), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52)
[2021-10-28 23:16:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 484 transitions.
[2021-10-28 23:16:36,414 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 484 transitions. Word has length 96
[2021-10-28 23:16:36,415 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:36,415 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 484 transitions.
[2021-10-28 23:16:36,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10)
[2021-10-28 23:16:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 484 transitions.
[2021-10-28 23:16:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2021-10-28 23:16:36,417 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:36,417 INFO L513 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]
[2021-10-28 23:16:36,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2021-10-28 23:16:36,418 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -693188859, now seen corresponding path program 1 times
[2021-10-28 23:16:36,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:36,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951988934]
[2021-10-28 23:16:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:36,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2021-10-28 23:16:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:36,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:36,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951988934]
[2021-10-28 23:16:36,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951988934] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:36,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:36,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2021-10-28 23:16:36,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401165207]
[2021-10-28 23:16:36,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2021-10-28 23:16:36,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2021-10-28 23:16:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342
[2021-10-28 23:16:36,856 INFO L87 Difference]: Start difference. First operand 416 states and 484 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12)
[2021-10-28 23:16:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:37,557 INFO L93 Difference]: Finished difference Result 461 states and 538 transitions.
[2021-10-28 23:16:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-10-28 23:16:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101
[2021-10-28 23:16:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:37,559 INFO L225 Difference]: With dead ends: 461
[2021-10-28 23:16:37,559 INFO L226 Difference]: Without dead ends: 435
[2021-10-28 23:16:37,562 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552
[2021-10-28 23:16:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states.
[2021-10-28 23:16:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425.
[2021-10-28 23:16:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 332 states have (on average 1.1837349397590362) internal successors, (393), 338 states have internal predecessors, (393), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52)
[2021-10-28 23:16:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 490 transitions.
[2021-10-28 23:16:37,574 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 490 transitions. Word has length 101
[2021-10-28 23:16:37,574 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:37,574 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 490 transitions.
[2021-10-28 23:16:37,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12)
[2021-10-28 23:16:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 490 transitions.
[2021-10-28 23:16:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2021-10-28 23:16:37,577 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:37,577 INFO L513 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]
[2021-10-28 23:16:37,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2021-10-28 23:16:37,578 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1496072861, now seen corresponding path program 1 times
[2021-10-28 23:16:37,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:37,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095824139]
[2021-10-28 23:16:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:37,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2021-10-28 23:16:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2021-10-28 23:16:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2021-10-28 23:16:37,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:37,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095824139]
[2021-10-28 23:16:37,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095824139] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:37,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:37,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-10-28 23:16:37,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984419946]
[2021-10-28 23:16:37,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-10-28 23:16:37,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-10-28 23:16:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2021-10-28 23:16:37,913 INFO L87 Difference]: Start difference. First operand 425 states and 490 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10)
[2021-10-28 23:16:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:38,633 INFO L93 Difference]: Finished difference Result 376 states and 423 transitions.
[2021-10-28 23:16:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-10-28 23:16:38,633 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 110
[2021-10-28 23:16:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:38,635 INFO L225 Difference]: With dead ends: 376
[2021-10-28 23:16:38,635 INFO L226 Difference]: Without dead ends: 376
[2021-10-28 23:16:38,635 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306
[2021-10-28 23:16:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states.
[2021-10-28 23:16:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 242.
[2021-10-28 23:16:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 189 states have (on average 1.1428571428571428) internal successors, (216), 191 states have internal predecessors, (216), 26 states have call successors, (26), 26 states have call predecessors, (26), 26 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26)
[2021-10-28 23:16:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions.
[2021-10-28 23:16:38,641 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 110
[2021-10-28 23:16:38,642 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:38,642 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions.
[2021-10-28 23:16:38,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10)
[2021-10-28 23:16:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions.
[2021-10-28 23:16:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2021-10-28 23:16:38,643 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:38,643 INFO L513 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]
[2021-10-28 23:16:38,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2021-10-28 23:16:38,644 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1225581856, now seen corresponding path program 1 times
[2021-10-28 23:16:38,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:38,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271571953]
[2021-10-28 23:16:38,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:38,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2021-10-28 23:16:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2021-10-28 23:16:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:39,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:39,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271571953]
[2021-10-28 23:16:39,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271571953] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:39,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:39,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:16:39,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019972597]
[2021-10-28 23:16:39,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:16:39,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:39,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:16:39,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:16:39,034 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13)
[2021-10-28 23:16:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:39,717 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions.
[2021-10-28 23:16:39,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:16:39,717 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117
[2021-10-28 23:16:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:39,721 INFO L225 Difference]: With dead ends: 256
[2021-10-28 23:16:39,721 INFO L226 Difference]: Without dead ends: 256
[2021-10-28 23:16:39,721 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342
[2021-10-28 23:16:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2021-10-28 23:16:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246.
[2021-10-28 23:16:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.140625) internal successors, (219), 194 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27)
[2021-10-28 23:16:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions.
[2021-10-28 23:16:39,732 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 117
[2021-10-28 23:16:39,733 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:39,735 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions.
[2021-10-28 23:16:39,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13)
[2021-10-28 23:16:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions.
[2021-10-28 23:16:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2021-10-28 23:16:39,737 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:39,737 INFO L513 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]
[2021-10-28 23:16:39,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2021-10-28 23:16:39,738 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1044095359, now seen corresponding path program 1 times
[2021-10-28 23:16:39,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:39,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872018301]
[2021-10-28 23:16:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:39,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2021-10-28 23:16:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2021-10-28 23:16:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:16:40,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:40,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872018301]
[2021-10-28 23:16:40,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872018301] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:40,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:40,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:16:40,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109391969]
[2021-10-28 23:16:40,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:16:40,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:16:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:16:40,084 INFO L87 Difference]: Start difference. First operand 246 states and 272 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13)
[2021-10-28 23:16:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:40,674 INFO L93 Difference]: Finished difference Result 256 states and 282 transitions.
[2021-10-28 23:16:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:16:40,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117
[2021-10-28 23:16:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:40,676 INFO L225 Difference]: With dead ends: 256
[2021-10-28 23:16:40,676 INFO L226 Difference]: Without dead ends: 252
[2021-10-28 23:16:40,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342
[2021-10-28 23:16:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states.
[2021-10-28 23:16:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246.
[2021-10-28 23:16:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.1354166666666667) internal successors, (218), 194 states have internal predecessors, (218), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27)
[2021-10-28 23:16:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 271 transitions.
[2021-10-28 23:16:40,682 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 271 transitions. Word has length 117
[2021-10-28 23:16:40,682 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:40,682 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 271 transitions.
[2021-10-28 23:16:40,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13)
[2021-10-28 23:16:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 271 transitions.
[2021-10-28 23:16:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2021-10-28 23:16:40,684 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:40,684 INFO L513 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]
[2021-10-28 23:16:40,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2021-10-28 23:16:40,685 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1109919017, now seen corresponding path program 1 times
[2021-10-28 23:16:40,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:40,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154317827]
[2021-10-28 23:16:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:40,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:40,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2021-10-28 23:16:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2021-10-28 23:16:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2021-10-28 23:16:41,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:41,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154317827]
[2021-10-28 23:16:41,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154317827] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:41,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:41,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2021-10-28 23:16:41,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894447329]
[2021-10-28 23:16:41,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2021-10-28 23:16:41,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:41,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2021-10-28 23:16:41,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600
[2021-10-28 23:16:41,324 INFO L87 Difference]: Start difference. First operand 246 states and 271 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14)
[2021-10-28 23:16:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:42,307 INFO L93 Difference]: Finished difference Result 315 states and 356 transitions.
[2021-10-28 23:16:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2021-10-28 23:16:42,310 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147
[2021-10-28 23:16:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:42,311 INFO L225 Difference]: With dead ends: 315
[2021-10-28 23:16:42,311 INFO L226 Difference]: Without dead ends: 283
[2021-10-28 23:16:42,311 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190
[2021-10-28 23:16:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states.
[2021-10-28 23:16:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263.
[2021-10-28 23:16:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.144927536231884) internal successors, (237), 209 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29)
[2021-10-28 23:16:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions.
[2021-10-28 23:16:42,316 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 147
[2021-10-28 23:16:42,317 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:42,317 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions.
[2021-10-28 23:16:42,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14)
[2021-10-28 23:16:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions.
[2021-10-28 23:16:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2021-10-28 23:16:42,318 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:42,319 INFO L513 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]
[2021-10-28 23:16:42,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2021-10-28 23:16:42,319 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:42,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2025391703, now seen corresponding path program 1 times
[2021-10-28 23:16:42,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:42,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779592858]
[2021-10-28 23:16:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:42,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2021-10-28 23:16:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2021-10-28 23:16:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2021-10-28 23:16:42,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:42,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779592858]
[2021-10-28 23:16:42,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779592858] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:42,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:42,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2021-10-28 23:16:42,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977649716]
[2021-10-28 23:16:42,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2021-10-28 23:16:42,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2021-10-28 23:16:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552
[2021-10-28 23:16:42,866 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14)
[2021-10-28 23:16:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:43,857 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions.
[2021-10-28 23:16:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2021-10-28 23:16:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 148
[2021-10-28 23:16:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:43,859 INFO L225 Difference]: With dead ends: 282
[2021-10-28 23:16:43,860 INFO L226 Difference]: Without dead ends: 277
[2021-10-28 23:16:43,860 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870
[2021-10-28 23:16:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states.
[2021-10-28 23:16:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263.
[2021-10-28 23:16:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.1400966183574879) internal successors, (236), 209 states have internal predecessors, (236), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29)
[2021-10-28 23:16:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions.
[2021-10-28 23:16:43,866 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 148
[2021-10-28 23:16:43,866 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:43,866 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions.
[2021-10-28 23:16:43,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14)
[2021-10-28 23:16:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions.
[2021-10-28 23:16:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2021-10-28 23:16:43,868 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:43,869 INFO L513 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]
[2021-10-28 23:16:43,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2021-10-28 23:16:43,869 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1867828009, now seen corresponding path program 1 times
[2021-10-28 23:16:43,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:43,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861196211]
[2021-10-28 23:16:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:43,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80
[2021-10-28 23:16:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2021-10-28 23:16:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2021-10-28 23:16:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2021-10-28 23:16:44,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:44,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861196211]
[2021-10-28 23:16:44,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861196211] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:44,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:44,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2021-10-28 23:16:44,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963259694]
[2021-10-28 23:16:44,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2021-10-28 23:16:44,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:44,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2021-10-28 23:16:44,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420
[2021-10-28 23:16:44,398 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15)
[2021-10-28 23:16:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:45,425 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions.
[2021-10-28 23:16:45,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2021-10-28 23:16:45,425 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 150
[2021-10-28 23:16:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:45,426 INFO L225 Difference]: With dead ends: 301
[2021-10-28 23:16:45,426 INFO L226 Difference]: Without dead ends: 263
[2021-10-28 23:16:45,427 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812
[2021-10-28 23:16:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2021-10-28 23:16:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257.
[2021-10-28 23:16:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 203 states have (on average 1.1280788177339902) internal successors, (229), 205 states have internal predecessors, (229), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28)
[2021-10-28 23:16:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions.
[2021-10-28 23:16:45,432 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 150
[2021-10-28 23:16:45,433 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:45,433 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions.
[2021-10-28 23:16:45,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15)
[2021-10-28 23:16:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions.
[2021-10-28 23:16:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2021-10-28 23:16:45,435 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:45,435 INFO L513 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]
[2021-10-28 23:16:45,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2021-10-28 23:16:45,436 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash -495529015, now seen corresponding path program 1 times
[2021-10-28 23:16:45,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:45,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176368397]
[2021-10-28 23:16:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:45,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2021-10-28 23:16:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2021-10-28 23:16:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2021-10-28 23:16:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2021-10-28 23:16:45,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:45,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176368397]
[2021-10-28 23:16:45,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176368397] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:45,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:45,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-10-28 23:16:45,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36711948]
[2021-10-28 23:16:45,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-10-28 23:16:45,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-10-28 23:16:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2021-10-28 23:16:45,865 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2021-10-28 23:16:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:46,633 INFO L93 Difference]: Finished difference Result 254 states and 276 transitions.
[2021-10-28 23:16:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:16:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 155
[2021-10-28 23:16:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:46,635 INFO L225 Difference]: With dead ends: 254
[2021-10-28 23:16:46,635 INFO L226 Difference]: Without dead ends: 243
[2021-10-28 23:16:46,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552
[2021-10-28 23:16:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states.
[2021-10-28 23:16:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229.
[2021-10-28 23:16:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 179 states have (on average 1.111731843575419) internal successors, (199), 181 states have internal predecessors, (199), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25)
[2021-10-28 23:16:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 248 transitions.
[2021-10-28 23:16:46,664 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 248 transitions. Word has length 155
[2021-10-28 23:16:46,665 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:46,665 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 248 transitions.
[2021-10-28 23:16:46,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2021-10-28 23:16:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 248 transitions.
[2021-10-28 23:16:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2021-10-28 23:16:46,667 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:46,667 INFO L513 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]
[2021-10-28 23:16:46,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2021-10-28 23:16:46,668 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1029557280, now seen corresponding path program 1 times
[2021-10-28 23:16:46,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:46,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242840208]
[2021-10-28 23:16:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:46,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2021-10-28 23:16:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2021-10-28 23:16:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2021-10-28 23:16:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2021-10-28 23:16:47,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:47,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242840208]
[2021-10-28 23:16:47,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242840208] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:47,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:47,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-10-28 23:16:47,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394186752]
[2021-10-28 23:16:47,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2021-10-28 23:16:47,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:47,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-10-28 23:16:47,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272
[2021-10-28 23:16:47,229 INFO L87 Difference]: Start difference. First operand 229 states and 248 transitions. Second operand has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15)
[2021-10-28 23:16:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:47,872 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions.
[2021-10-28 23:16:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-10-28 23:16:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 157
[2021-10-28 23:16:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:47,874 INFO L225 Difference]: With dead ends: 218
[2021-10-28 23:16:47,874 INFO L226 Difference]: Without dead ends: 208
[2021-10-28 23:16:47,874 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462
[2021-10-28 23:16:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2021-10-28 23:16:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208.
[2021-10-28 23:16:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.0993788819875776) internal successors, (177), 162 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23)
[2021-10-28 23:16:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions.
[2021-10-28 23:16:47,878 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 157
[2021-10-28 23:16:47,879 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:47,879 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions.
[2021-10-28 23:16:47,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15)
[2021-10-28 23:16:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions.
[2021-10-28 23:16:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2021-10-28 23:16:47,881 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:47,881 INFO L513 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]
[2021-10-28 23:16:47,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2021-10-28 23:16:47,882 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:47,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1506473619, now seen corresponding path program 1 times
[2021-10-28 23:16:47,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:47,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038760979]
[2021-10-28 23:16:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:47,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2021-10-28 23:16:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2021-10-28 23:16:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2021-10-28 23:16:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2021-10-28 23:16:48,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:48,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038760979]
[2021-10-28 23:16:48,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038760979] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:48,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:48,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2021-10-28 23:16:48,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515731712]
[2021-10-28 23:16:48,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2021-10-28 23:16:48,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:48,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2021-10-28 23:16:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380
[2021-10-28 23:16:48,412 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15)
[2021-10-28 23:16:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:49,802 INFO L93 Difference]: Finished difference Result 351 states and 375 transitions.
[2021-10-28 23:16:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2021-10-28 23:16:49,803 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 158
[2021-10-28 23:16:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:49,804 INFO L225 Difference]: With dead ends: 351
[2021-10-28 23:16:49,804 INFO L226 Difference]: Without dead ends: 211
[2021-10-28 23:16:49,805 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352
[2021-10-28 23:16:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2021-10-28 23:16:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208.
[2021-10-28 23:16:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.093167701863354) internal successors, (176), 162 states have internal predecessors, (176), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23)
[2021-10-28 23:16:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 222 transitions.
[2021-10-28 23:16:49,810 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 222 transitions. Word has length 158
[2021-10-28 23:16:49,810 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:49,810 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 222 transitions.
[2021-10-28 23:16:49,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15)
[2021-10-28 23:16:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 222 transitions.
[2021-10-28 23:16:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2021-10-28 23:16:49,827 INFO L505 BasicCegarLoop]: Found error trace
[2021-10-28 23:16:49,828 INFO L513 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]
[2021-10-28 23:16:49,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2021-10-28 23:16:49,828 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2021-10-28 23:16:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:16:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 424652015, now seen corresponding path program 1 times
[2021-10-28 23:16:49,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:16:49,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981285153]
[2021-10-28 23:16:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:16:49,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:16:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2021-10-28 23:16:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2021-10-28 23:16:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2021-10-28 23:16:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2021-10-28 23:16:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2021-10-28 23:16:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2021-10-28 23:16:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2021-10-28 23:16:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2021-10-28 23:16:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2021-10-28 23:16:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2021-10-28 23:16:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2021-10-28 23:16:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2021-10-28 23:16:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2021-10-28 23:16:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2021-10-28 23:16:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:16:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2021-10-28 23:16:50,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:16:50,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981285153]
[2021-10-28 23:16:50,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981285153] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:16:50,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:16:50,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2021-10-28 23:16:50,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123499736]
[2021-10-28 23:16:50,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2021-10-28 23:16:50,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:16:50,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2021-10-28 23:16:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650
[2021-10-28 23:16:50,539 INFO L87 Difference]: Start difference. First operand 208 states and 222 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 12 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15)
[2021-10-28 23:16:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:16:51,886 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions.
[2021-10-28 23:16:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2021-10-28 23:16:51,887 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 12 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 158
[2021-10-28 23:16:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:16:51,888 INFO L225 Difference]: With dead ends: 208
[2021-10-28 23:16:51,888 INFO L226 Difference]: Without dead ends: 0
[2021-10-28 23:16:51,888 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070
[2021-10-28 23:16:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-10-28 23:16:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-10-28 23:16:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:16:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-10-28 23:16:51,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158
[2021-10-28 23:16:51,890 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:16:51,890 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-10-28 23:16:51,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 12 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15)
[2021-10-28 23:16:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-10-28 23:16:51,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-10-28 23:16:51,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK
[2021-10-28 23:16:51,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK
[2021-10-28 23:16:51,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2021-10-28 23:16:51,907 INFO L731 BasicCegarLoop]: Path program 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]
[2021-10-28 23:16:51,909 INFO L179 ceAbstractionStarter]: Computing trace abstraction results
[2021-10-28 23:16:51,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:16:51 BoogieIcfgContainer
[2021-10-28 23:16:51,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-28 23:16:51,921 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-28 23:16:51,921 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-28 23:16:51,921 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-28 23:16:51,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:15:28" (3/4) ...
[2021-10-28 23:16:51,926 INFO L137 WitnessPrinter]: Generating witness for correct program
[2021-10-28 23:16:51,934 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error
[2021-10-28 23:16:51,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface
[2021-10-28 23:16:51,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init
[2021-10-28 23:16:51,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests
[2021-10-28 23:16:51,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState
[2021-10-28 23:16:51,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp
[2021-10-28 23:16:51,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main
[2021-10-28 23:16:51,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose
[2021-10-28 23:16:51,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired
[2021-10-28 23:16:51,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete
[2021-10-28 23:16:51,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject
[2021-10-28 23:16:51,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest
[2021-10-28 23:16:51,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver
[2021-10-28 23:16:51,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init
[2021-10-28 23:16:51,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo
[2021-10-28 23:16:51,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy
[2021-10-28 23:16:51,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink
[2021-10-28 23:16:51,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription
[2021-10-28 23:16:51,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose
[2021-10-28 23:16:52,006 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges
[2021-10-28 23:16:52,008 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges
[2021-10-28 23:16:52,009 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges
[2021-10-28 23:16:52,011 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2021-10-28 23:16:52,176 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/witness.graphml
[2021-10-28 23:16:52,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-28 23:16:52,178 INFO L168 Benchmark]: Toolchain (without parser) took 85391.25 ms. Allocated memory was 117.4 MB in the beginning and 251.7 MB in the end (delta: 134.2 MB). Free memory was 79.7 MB in the beginning and 166.5 MB in the end (delta: -86.8 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB.
[2021-10-28 23:16:52,178 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 117.4 MB. Free memory is still 96.8 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 23:16:52,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.78 ms. Allocated memory is still 117.4 MB. Free memory was 79.5 MB in the beginning and 84.0 MB in the end (delta: -4.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB.
[2021-10-28 23:16:52,179 INFO L168 Benchmark]: Boogie Preprocessor took 105.15 ms. Allocated memory is still 117.4 MB. Free memory was 84.0 MB in the beginning and 80.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
[2021-10-28 23:16:52,179 INFO L168 Benchmark]: RCFGBuilder took 1129.55 ms. Allocated memory is still 117.4 MB. Free memory was 80.3 MB in the beginning and 84.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 40.5 MB. Max. memory is 16.1 GB.
[2021-10-28 23:16:52,179 INFO L168 Benchmark]: TraceAbstraction took 83191.20 ms. Allocated memory was 117.4 MB in the beginning and 251.7 MB in the end (delta: 134.2 MB). Free memory was 83.5 MB in the beginning and 185.4 MB in the end (delta: -101.9 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB.
[2021-10-28 23:16:52,180 INFO L168 Benchmark]: Witness Printer took 255.45 ms. Allocated memory is still 251.7 MB. Free memory was 185.4 MB in the beginning and 166.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
[2021-10-28 23:16:52,181 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.27 ms. Allocated memory is still 117.4 MB. Free memory is still 96.8 MB. There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 701.78 ms. Allocated memory is still 117.4 MB. Free memory was 79.5 MB in the beginning and 84.0 MB in the end (delta: -4.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 105.15 ms. Allocated memory is still 117.4 MB. Free memory was 84.0 MB in the beginning and 80.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 1129.55 ms. Allocated memory is still 117.4 MB. Free memory was 80.3 MB in the beginning and 84.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 40.5 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 83191.20 ms. Allocated memory was 117.4 MB in the beginning and 251.7 MB in the end (delta: 134.2 MB). Free memory was 83.5 MB in the beginning and 185.4 MB in the end (delta: -101.9 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB.
* Witness Printer took 255.45 ms. Allocated memory is still 251.7 MB. Free memory was 185.4 MB in the beginning and 166.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 670]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- PositiveResult [Line: 65]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 28 procedures, 313 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 83.1s, OverallIterations: 51, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 64.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 15311 SDtfs, 21994 SDslu, 35616 SDs, 0 SdLazy, 57322 SolverSat, 7549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1520 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=831occurred in iteration=11, InterpolantAutomatonStates: 665, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 51 MinimizatonAttempts, 2436 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 3807 NumberOfCodeBlocks, 3807 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3756 ConstructedInterpolants, 0 QuantifiedInterpolants, 17225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 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
- AllSpecificationsHoldResult: All specifications hold
2 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2021-10-28 23:16:52,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3a0e06-335a-4661-b897-b7ca593205c2/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...